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;
const int N = 222222;
const int mod = 1e9 + 7;
long long n;
int main() {
  cin >> n;
  for (long long i = 1; i * (i + 1) <= n * 2; ++i) {
    long long x = n - (i * (i + 1) / 2);
    long long t = sqrt(x * 2);
    for (long long j = t - 10; j <= t + 10; ++j)
      if (j > 0 && j * (j + 1) == x * 2) return cout << "YES", 0;
  }
  cout << "NO";
  return 0;
}