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 n;
bool valid(long long sum, long long mid) {
  if (sum + (mid * (mid + 1) / 2) <= n) {
    return true;
  }
  return false;
}
bool bs(long long sum) {
  int st = 1, ed = 100000;
  while (st < ed) {
    int mid = st + (ed - st + 1) / 2;
    if (valid(sum, mid)) {
      st = mid;
    } else {
      ed = mid - 1;
    }
  }
  if (st * (st + 1) / 2 + sum == n) {
    return true;
  }
  return false;
}
int main() {
  bool flg = 0;
  scanf("%lld", &n);
  for (int i = 1; i < 100000; i++) {
    if (bs(i * (i + 1) / 2)) {
      flg = 1;
    }
    if (i * (i + 1) / 2 >= n) {
      break;
    }
  }
  if (flg) {
    puts("YES");
  } else {
    puts("NO");
  }
}