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:
n = int(input())
if n==1:
    print("NO")
elif n==2:
    print("YES")
elif n==3:
    print("NO")
elif n==4:
    print("YES")
else:
    sqrt_n = int(n**(0.5))//1
    num = 2*(sqrt_n)
    l1 = []
    ismatched = False
    for i in range(1,num+1):
        val = (i*(i+1))//2
        val_2 = n - val
        if val_2>=0:
            discriminat = (1+8*val_2)**(0.5)
            if (int(discriminat))*(int(discriminat))==(1+8*val_2):
                val3 = (discriminat-1)//2
                if n==1:
                    print("NO")
                else:
                    if int(val3*2)==discriminat-1:
                        if int(val3)<=num:
                            val4 = int(val3)
                            if n==(i*(i+1))//2 +(val4*(val4+1)//2) and val4!=0:
                                print("YES")
                                ismatched = True
                                break
    if ismatched==False:
        print("NO")