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;
long long a;
long long ret(long long x) {
  x = x * (x + 1);
  return x / 2;
}
bool fnc(long long ve) {
  int lo = 1, hi = a, mid;
  while (lo <= hi) {
    mid = (lo + hi) >> 1;
    long long x = ve + ret(mid);
    if (x == a)
      return 1;
    else if (x < a)
      lo = mid + 1;
    else
      hi = mid - 1;
  }
  return 0;
}
int main() {
  long long rt, i = 1;
  scanf("%lld", &a);
  bool f = 0;
  rt = sqrt(a);
  for (; i <= rt; i++) {
    if (fnc(ret(i))) {
      f = 1;
      break;
    }
  }
  printf("%s\n", f ? "YES" : "NO");
  return 0;
}