#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

bool is_square(int x){
    int ok = 1, ng = 10001;
    while(ng-ok>1){
        int md = (ok+ng)/2;
        if(md*md<=x) ok = md;
        else ng = md;
    }
    return ok*ok==x;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    for(int i=1;i*i<n;i++){
        if(is_square(n-i*i)){
            cout << "Yes\n";
            return 0;
        }
    }
    cout << "No\n";
    return 0;
}