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:
import math
n=int(input())
t=math.sqrt(n)
if(n==1):
    print("NO")
    exit(0)
else:
    for i in range(1,int(t)+1):
        q=n-(i*(i+1))/2
        q1=1+8*q;
        q2=math.sqrt(q1)
        q3=int(q2)
        if(q3*q3==q1):
           print("YES")
           exit(0)
print("NO")