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;
bool cc(long long now) {
  if (now < 0) return false;
  long long l = 1, r = (long long)sqrt(now) * 5;
  while (l <= r) {
    long long mid = (l + r) / 2;
    long long tmp = (mid + 1) * mid / 2;
    if (tmp == now)
      return true;
    else if (tmp > now)
      r = mid - 1;
    else
      l = mid + 1;
  }
  return false;
}
int main() {
  long long n;
  while (cin >> n) {
    long long len = (long long)sqrt(n) * 2;
    bool ok = false;
    for (long long i = 1; i <= len; i++) {
      if (cc(n - i * (i + 1) / 2)) {
        ok = true;
        break;
      }
    }
    ok ? puts("YES") : puts("NO");
  }
  return 0;
}