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:
from sys import*
import math
"""def funky(n):
	i = 1
	test = False
	while(((i*(i+1))/2) < n):
		y = n-((i*(i+1))/2)
		j = 1
		while(((j*(j+1))/2) <= y):
			if(((j*(j+1))/2) == y):
				test = True
				break
			else:
				j = j+1
		if(test == True):
			break
		else:
			i = i+1
	return test
n = int(input())
if(funky(n) == True):
	print("yes")
else:
	print("no")
"""


def funky_number(n):
	i =1
	j =2
	test = False
	while(i<n):
		y = n - i
		m = int(math.sqrt(2*y))
		if((m*(m+1)) == 2*y):
			test = True
			break
		else:
			i = i+j
			j = j+1
	return test
n = int(input())
if(funky_number(n) == True):
	print("yes")
else:
	print("no")