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, m, t;
long long ar[100005];
int main() {
  long long i, j;
  scanf("%lld", &n);
  long long l, r;
  long long a, b, mid;
  long long p = 0;
  for (i = 1; i <= sqrt(n); i++) {
    a = i * (i + 1) / 2;
    l = i;
    r = n;
    mid = (l + r) / 2;
    while (l <= r) {
      b = mid * (mid + 1) / 2;
      if (a + b < n) {
        l = mid + 1;
        mid = (l + r) / 2;
      } else if (a + b > n) {
        r = mid - 1;
        mid = (l + r) / 2;
      } else {
        p = 1;
        break;
      }
    }
    if (p == 1) {
      break;
    }
  }
  if (p == 1) {
    printf("YES\n");
  } else {
    printf("NO\n");
  }
  return 0;
}