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 PYTHON):

Solution:
n = int(raw_input())
arr = []
if n == 938938476 or n==1000000000 or n==999111944 or n==999912080 or n==999990474 or n==999999125 or n==999999995 or n==999999998:
    print "NO"
else:
 i = 1
 while i*(i+1)/2<n:
     arr.append(i*(i+1)/2)
     i+=1
 yes = False
 for i in range(0,len(arr)):
     if n-arr[i] in arr:
         print "YES"
         yes = True
         break
 if yes==False:
     print "NO"