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 math import *
n=int(input())
count=0
for i in range(1,int(n/2)+1):
  a=(i*(i+1))/2
  b=str(a)
 
  if b[-1]=='0':
    x=n-int(a)
   
    if x<0:
      break
    square_root=sqrt(8*x+1)
   
    square_root1=str(square_root)
    if square_root1[-1]=='0':
    
      c=(square_root-1)/2
      if c==0.0:
        continue
      else:
         c=str(c)
         if c[-1]=='0':
             print('YES')
             count=1
             break
if count==0:
  print('NO')