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 int N = 1e5;
int main() {
  int x;
  cin >> x;
  x *= 2;
  for (int i = 1; i <= N; ++i) {
    long long sum1 = 1LL * i * i + i;
    int l = 1, r = N;
    bool ok = false;
    while (l <= r) {
      int m = l + (r - l) / 2;
      long long sum2 = 1LL * m * m + m;
      if (sum1 + sum2 <= x) {
        if (sum1 + sum2 == x) {
          cout << "YES" << endl;
          return 0;
        } else {
          l = m + 1;
        }
      } else {
        r = m - 1;
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}