Problem: As you very well know, this year's funkiest numbers are so called triangular numbers (that is, integers that are representable as <image>, where k is some positive integer), and the coolest numbers are those that are representable as a sum of two triangular numbers.

A well-known hipster Andrew adores everything funky and cool but unfortunately, he isn't good at maths. Given number n, help him define whether this number can be represented by a sum of two triangular numbers (not necessarily different)!

Input

The first input line contains an integer n (1 ≤ n ≤ 109).

Output

Print "YES" (without the quotes), if n can be represented as a sum of two triangular numbers, otherwise print "NO" (without the quotes).

Examples

Input

256


Output

YES


Input

512


Output

NO

Note

In the first sample number <image>.

In the second sample number 512 can not be represented as a sum of two triangular numbers.

Solution (in PYTHON3):

Solution:

def binarySearch (arr, l, r, x): 

	# Check base case 
	if r >= l: 

		mid = l + (r - l)//2

		# If element is present at the middle itself 
		if arr[mid] == x: 
			return mid 
		
		# If element is smaller than mid, then it can only 
		# be present in left subarray 
		elif arr[mid] > x: 
			return binarySearch(arr, l, mid-1, x) 

		# Else the element can only be present in right subarray 
		else: 
			return binarySearch(arr, mid+1, r, x) 

	else: 
		# Element is not present in the array 
		return -1




def checkTriangularSumRepresentation(n) :  
      
    tri = list();  
    i = 1;  

    while (1) : 
        x = i * (i + 1) // 2;  
        if (x >= n) : 
            break;  
              
        tri.append(x);  
        i += 1;  
  
    # Check if a pair exists  
    for tm in tri :
        a = n-tm
        if(binarySearch(tri,0,len(tri)-1,a)!=-1):
            return True;  
              
    return False;  
  
 
n = int(input())  
      
if checkTriangularSumRepresentation(n): 
    print("YES") 
else : 
    print("NO")