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, A, B;
bool fuck(long long x) {
  long long suck = (x << 2ll) + 1ll;
  long long q = sqrt((double)suck);
  return (q * q == suck) && (q & 1ll);
}
int main() {
  scanf("%I64d", &N);
  A = 1;
  N <<= 1;
  bool zhuo = false;
  while (A * (A + 1) < N) {
    long long suck = N - A * (A + 1);
    if (fuck(suck)) {
      zhuo = true;
      break;
    }
    A++;
  }
  if (zhuo)
    printf("YES");
  else
    printf("NO");
  return 0;
}