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:
from sys import stdin, stdout

n = int(stdin.readline())

label = 0
first = 1
while first * (first + 1) // 2 < n:
    cnt = n - first * (first + 1) // 2
    
    l = 0
    r = cnt + 10
    while (r - l > 1):
        m = (r + l) // 2
        
        if m * (m + 1) // 2 > cnt:
            r = m
        else:
            l = m
    
    if l * (l + 1) // 2 == cnt:
        label = 1
        break
    
    first += 1


if label:
    stdout.write('YES')
else:
    stdout.write('NO')