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 check(int a) {
  int sum = 0, i = 1;
  while (sum <= a) {
    sum = sum + i;
    i++;
    if (sum == a) {
      return 1;
    }
  }
  return 0;
}
int main() {
  int res;
  cin >> res;
  int i = 1, sum = 0;
  for (i = 1; sum <= res; i++) {
    if (res == 1) {
      cout << "NO";
      break;
    }
    sum = sum + i;
    if (check(res - sum)) {
      cout << "YES";
      break;
    }
  }
  if (sum > res) cout << "NO";
  return 0;
}