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:
import sys, os.path
from collections import*
from copy import*
import math
mod=10**9+7
if(os.path.exists('input.txt')):
    sys.stdin = open("input.txt","r")
    sys.stdout = open("output.txt","w")

def bs(left,right,x):
    while(left<=right):
        mid=left+(right-left)//2
        b=(mid*(mid+1))//2
        if(b==x):
            return 1
        elif(b>x):
            right=mid-1
        else:
            left=mid+1
    return 0
n=int(input())
n1=10**5
flag=0
for i in range(1,n1+1):
    a=(i*(i+1))//2
    if(bs(1,n1,n-a)):
        flag=1
        break
if(flag==0):
    print('NO')
else:
    print('YES')