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:
r=lambda x:(x*(x+1))//2
z=[r(i) for i in range(1,50001)]
def bin_S(x):
    lo=0;hi=50000
    while lo<=hi:
        mid=(lo+hi)//2
        if z[mid]==x:return True
        if z[mid]>x:hi=mid-1
        else:lo=mid+1
    return False
def check(a):
    for i in z:
        if bin_S(a-i):return "YES"
    return "NO"
print(check(int(input())))