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;
const double pi = acos(-1.0);
const int inf = (int)1e9;
const double inf1 = 1e-9;
int main() {
  int n;
  scanf("%d", &n);
  vector<int> mas;
  int i = 1;
  int k = 2;
  vector<bool> b(2 * inf);
  bool t = false;
  while (i < 2 * inf) {
    mas.push_back(i);
    b[i] = true;
    i += k;
    ++k;
  }
  for (int j = 0; j < mas.size(); ++j) {
    if (n - mas[j] < 0) break;
    if (b[n - mas[j]] == true) {
      t = true;
      break;
    }
  }
  if (t)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}