#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);

ll arrsum(ll l, ll k) {
  return (l+k-1)*(l+k)/2-(l-1)*l/2;
}

int main() {
  ll A;
  cin>>A;
  ll l, r, m;
  bool can = false;
  for(ll k=3;k<100000;++k) {
    l = 0;
    r = A;
    while(l<r) {
      m = (l+r)/2;
      if(arrsum(m, k)<A) l = m+1;
      else r = m;
    }
    if(arrsum(l, k)==A) can = true;
  }
  if(can) cout<<"YES"<<endl;
  else cout<<"NO"<<endl;
}