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:
import math

def isTriangular(n):
  if n < 0:
    return False
	
  res = (math.sqrt(8*n + 1) - 1.0)/2.0
  res2 = int(res)
  if res > 0 and float(res2) == res:
    return True
  return False	
  
  
n = int(raw_input())  
  
possible = False

  
for i in range(1, 100000):
  first = i*(i+1)/2
  rem = n - first
  
  if isTriangular(rem):
    possible = True
    break
	
if possible:
  print "YES"
else:
  print "NO"