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;
vector<long long int> v;
void funky() {
  long long int i = 1;
  long long int dif = 2;
  while (i <= 1000000000) {
    v.push_back(i);
    i += dif;
    dif++;
  }
}
int main() {
  funky();
  long long int n;
  while (cin >> n) {
    bool flag = false;
    int i = 0, j = v.size() - 1;
    while (i <= j) {
      if (v[i] + v[j] == n) {
        flag = true;
        break;
      } else if (v[i] + v[j] > n)
        j--;
      else if (v[i] + v[j] < n)
        i++;
    }
    puts(flag ? "YES" : "NO");
  }
  return 0;
}