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:
def check(x):
    if x < 1:
        return False
    r = int((x * 2) ** 0.5)
    candi = [r + i - 5 for i in range(10)]
    for i in candi:
        if i > 0 and i * (i + 1) / 2 == x:
            return True
    return False

if __name__ == '__main__':
    n = input()
    for i in xrange(1, 1000000):
        t = i * (i + 1) / 2
        if t >= n:
            break
        if check(n - t):
            print 'YES'
            exit()
    print 'NO'