#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using namespace atcoder;

typedef modint998244353 mint;
typedef long long ll;

int main(){
	ll s; cin >> s;
	ll a = (ll)4096;
	ll b = (ll)244140625;
	ll x = s % a;
	ll y = s % b;
	ll ra = -1;
	ll rb = -1;
	for (ll i=0; i<a; i++){
		if (i * i % a == x){
			ra = i;
			break;
		}
	}
	for (ll i=0; i<b; i++){
		if (i * i % b == y){
			rb = i;
			break;
		}
	}
	if (ra == -1 || rb == -1){
		cout << "NO" << endl;
		return 0;
	}
	cout << "YES" << endl;
}