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;
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= 2 * sqrt(n) + 100; i++) {
    int x1 = (i * (i + 1)) / 2;
    int tmp = n - x1;
    int s = 1, e = 2 * sqrt(n) + 100;
    while (s <= e) {
      int mid = s + (e - s) / 2;
      int x2 = (mid * (mid + 1)) / 2;
      if (x2 == tmp) {
        cout << "YES\n";
        return 0;
      } else if (x2 < tmp) {
        s = mid + 1;
      } else {
        e = mid - 1;
      }
    }
  }
  cout << "NO\n";
}