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(ar,l,r,x):
	if r >= l:
		mid = l + (r-l)//2
		if ar[mid] == x:
			return mid
		elif ar[mid] < x:
			return binarysearch(ar,mid+1,r,x)
		else:
			return binarysearch(ar,l,mid-1,x)	
	return -1			
def funky(n):
	a = (int((2*n)**(.5))+int(2))
	ar = []
	for i in range(1,a):
		k = int(i*(i+1)/2)
		ar.append(k)
	return ar	
def CoolestNum(ar,l,r,x):
	b = binarysearch(ar,l,r,x/2)
	if b != -1:
		return "YES"
	else:		
		g = len(ar)	
		for i in range(g-1,-1,-1):
			if ar[i] > x//2:
				diff = x - ar[i]
				term = binarysearch(ar,0,g-1,diff)
				if term != -1:
					return "YES"
	return "NO"			

n = int(input())
ar = funky(n)
q = len(ar)
print(CoolestNum(ar,0,q-1,n))