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 a[50001], n, m, i, j, k, l, ke, r, q;
void search(long x, long y, long z) {
  if (y - x == 1)
    if (a[x] == z)
      ke = 1;
    else if (a[y] == z)
      ke = 1;
  if (y - x > 1) {
    if (a[(x + y) / 2] == z)
      ke = 1;
    else if (a[(x + y) / 2] > z)
      search(x, (x + y) / 2, z);
    else if (a[(x + y) / 2] < z)
      search((x + y) / 2, y, z);
  }
}
int main() {
  cin >> n;
  while (r < n) {
    q++;
    r += q;
    a[q] = r;
  }
  for (i = 1; i <= q; i++) {
    search(1, q, n - a[i]);
    if (ke == 1) {
      cout << "YES" << endl;
      break;
    }
  }
  if (ke == 0) cout << "NO" << endl;
}