#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:20000007")
#pragma GCC optimize("unroll-loops")
const int N = (int)1e6 + 100;
const int maxn = (int)1e3 + 100;
const int base = (int)1e9;
const int mod = (int)1e9 + 7;
const int inf = INT_MAX;
const long long ll_inf = LLONG_MAX;
const long double pi = acos((long double)-1.0);
const long double eps = 1e-8;
void solve() {
  int n;
  cin >> n;
  map<int, bool> is;
  for (int i = 1; i * (i + 1) <= 2 * (int)1e9; ++i) is[i * (i + 1)] = true;
  for (int i = 1; i * (i + 1) <= 2 * (int)1e9; ++i) {
    int j = 2 * n - i * (i + 1);
    int j_sqrt = sqrt(j);
    if (is[j]) {
      cout << "YES\n";
      return;
    }
  }
  cout << "NO\n";
}
int main() {
  int T = 1;
  for (; T; --T) solve();
  return 0;
}
