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:
#coding=utf-8
import math

stack = []

a = 1

res = 1

n = 0

def func():
    global n

    Flag = True
    k = 1

    tt = int(1.5*math.sqrt(n))
    while k < n:
        Flag = False
        t = k
        x  = k*(k+1)/2
        r = x
        if r >= n:
            break

        rr = int(math.floor(math.sqrt(2*(n-x))))

        rrr = rr*(rr+1)/2 + x
        if rrr ==n:
            print 'YES'
            #print k
            exit(0)

        k = k + 1

def main():
    global n

    r = raw_input()
    n  = int(r)

    func()
    print 'NO'

if __name__ == "__main__":
    main()