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:
#triangle numbers
#k(k-1)/2
#representated sum of 2 trinagular numbers
#after some algerba i got: f=k(k+k)
# k**2=n-k
#k=n*2 - (k*(k-1))
# finaly 2n=k(k+1) + k(k+1)
import math
def funkyNumbers():
    n=int(input())
    i=1
    con=0
    for i in range(1,n):
        if i*(i+1)>n:
            break
        k=int(round(math.sqrt((n*2)-(i*(i+1)))))
        if i*(i+1)+ k*(k+1)==2*n:
            return "YES"
    return "NO"
print(funkyNumbers())