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:
import bisect

def bs(array,number):
    i=bisect.bisect_left(array,number)
    if i!=len(array) and array[i]==number:
        return True
    return False

def bs2(array,number):
    lo=0;hi=len(array)
    while lo<hi:
        mid=(lo+hi)>>1
        if (mid<number):
            lo=mid+1
        else:
            hi=mid
    if lo>=len(arr):
        return False
    return arr[lo]==number

n=int(raw_input())
arr=[]
can=True
for i in xrange(1,50000):
    arr.append(i*(i+1)//2)
for i in arr:
    y=n-i
    if y<0:
        can=False
        break
    if bs(arr,y):
        can=True
        break

print can and "YES" or "NO"