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 cheak(long long n) {
  for (long long i = 1; i < sqrt(n) + 3; i++) {
    if (i * (i + 1) > n) return false;
    long long nn = n - i * (i + 1);
    long long mm = sqrt(nn);
    for (long long j = mm - 2; j <= mm + 2; j++)
      if (j > 0)
        if (j * (j + 1) == nn) return true;
  }
  return false;
}
int main() {
  cin >> n;
  n = n * 2;
  if (cheak(n))
    printf("YES\n");
  else
    printf("NO\n");
}