human
Saint | Function to check if a number is a Saint - Exupery number.
Considering triplets in sorted order . The value of first element in sorted triplet can be at - most n / 3..
The value of second element must be less than equal to n / 2.
Given Number N.
Function Call"
Solution in Python:

=====
Give me a code to saint and the other steps required?
assistant
#Here is code to saint and the other steps required.
 def isSaintExuperyNum ( n ) :
	for i in range ( 1 , ( n // 3 ) + 1 ) :
		for j in range ( i + 1 , ( n // 2 ) + 1 ) :
			k = n / i / j
			if i * i + j * j == k * k :
				if i * j * k == n :
					return True
	return False
N = 60
if isSaintExuperyNum ( N ) :
	print ( " Yes " )
else :
	print ( " No " )