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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long int a;
long long int trans(int i) { return ((i * (i + 1)) / 2); }
bool BS(int target, int b, int e) {
  long long int mid = (b + e) / 2;
  if (b > e) return 0;
  if (trans(mid) == target)
    return 1;
  else if (trans(mid) > target)
    e = mid - 1;
  else if (trans(mid) < target)
    b = mid + 1;
  return BS(target, b, e);
}
int main() {
  cin >> a;
  long long int i = 1;
  while (trans(i) < a) {
    long long int j = trans(i);
    if (BS((a - j), 0, 90000)) {
      cout << "YES";
      return 0;
    }
    i++;
  }
  cout << "NO";
  return 0;
}