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>
int a[50005], num;
int bs(int v) {
  int left = 1, right = num;
  while (left <= right) {
    int m = (left + right) / 2;
    if (a[m] == v)
      return 1;
    else if (a[m] > v)
      right = m - 1;
    else
      left = m + 1;
  }
  return 0;
}
int main() {
  int i, n;
  for (i = 1; i * (i + 1) / 2 <= 1000000000; i++) {
    a[i] = i * (i + 1) / 2;
  }
  num = i - 1;
  scanf("%d", &n);
  for (i = 1; i <= num; i++) {
    if (bs(n - a[i])) {
      printf("YES\n");
      return 0;
    }
  }
  printf("NO\n");
  return 0;
}