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;
void funky(int n) {
  vector<int> fun;
  for (int i{1}; i < n; i++) {
    if (i * (i + 1) / 2 < n) {
      fun.push_back(i * (i + 1) / 2);
    } else {
      break;
    }
  }
  int s = -1, e = -1;
  for (int i{0}; i < fun.size(); i++) {
    int req = n - fun[i];
    if (req <= fun[fun.size() - 1]) {
      for (int j = fun.size() - 1; fun[j] > req - 1; j--) {
        if (fun[i] + fun[j] == n) {
          s = fun[i];
          e = fun[j];
          break;
        } else {
          continue;
        }
      }
    } else {
      continue;
    }
  }
  if (s == -1 && e == -1) {
    cout << "NO";
  } else {
    cout << "YES";
  }
}
int main() {
  int n;
  cin >> n;
  funky(n);
  return 0;
}