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:
from Queue import * # Queue, LifoQueue, PriorityQueue
from bisect import * #bisect, insort
from datetime import * 
from collections import * #deque, Counter,OrderedDict,defaultdict
import calendar
import heapq
import math
import copy
import itertools
myread = lambda : map(int,raw_input().split())
def solver():
    n = input()
    
    triangles = [ (x * (x + 1)) / 2 for x in range(1,50000)]

    for i in range(len(triangles)):
        lp = i
        up = len(triangles) - 1
        now_num = triangles[i]
        while lp != up:
            mid = (lp + up) / 2
            
            if now_num + triangles[mid] < n:
                lp = mid + 1
            else:
                up = mid

        if now_num + triangles[lp] == n:
            #print now_num,triangles[lp]
            print "YES"
            return

    print "NO"

if __name__ == "__main__":
    solver()