#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
int main() {
  long long n;
  cin >> n;
  long long s = 1, in = 1;
  vector<long long> v;
  while (s <= n) {
    v.push_back(s);
    in++;
    s += in;
  }
  long long f = 0;
  for (long long i = 0; i < (long long)v.size() && v[i] < n; i++) {
    long long req = n - v[i];
    if (binary_search(v.begin(), v.end(), req)) {
      f = 1;
      break;
    }
  }
  if (f)
    cout << "YES"
         << "\n";
  else
    cout << "NO"
         << "\n";
}
