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;
int tri[50000];
void init() {
  int i, j, k;
  k = 1;
  for (i = 1; i < 44721; i++) {
    tri[i] = (i * (i + 1)) / 2;
  }
  tri[0] = 0;
}
bool make(int n) {
  int i, j, k;
  for (i = 44720; i; i--) {
    if (tri[i] < n) break;
  }
  j = 1;
  while (i && tri[j] <= tri[i]) {
    if (tri[j] + tri[i] == n) {
      return true;
    } else if (tri[j] + tri[i] < n)
      j++;
    else {
      i--;
      while (tri[j] + tri[i] > n) j--;
    }
  }
  return false;
}
int main() {
  int i, j, k;
  int n;
  init();
  while (cin >> n) {
    if (n == 1) {
      cout << "NO" << endl;
      continue;
    }
    if (make(n)) {
      cout << "YES" << endl;
    } else
      cout << "NO" << endl;
  }
  return 0;
}