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;
int main() {
  long long n;
  cin >> n;
  long long p;
  long long q;
  long long r;
  long long s;
  double t;
  int ans = 0;
  if (n == 1) {
    cout << "NO" << endl;
    return 0;
  }
  for (long long i = 1; i <= sqrt(n); i++) {
    p = (i * (i + 1)) / 2;
    q = n - p;
    r = (8 * q) + 1;
    s = sqrt(r);
    t = sqrt((double)r);
    if (s == t) {
      ans = 1;
      break;
    }
  }
  if (ans == 1) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
  return 0;
}