#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = (int)1e9 + 1001010;
constexpr ll llINF = (ll)4e18 + 22000020;
const string endn = "\n";
template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}
const string ELEM_SEPARATION = " ", VEC_SEPARATION = endn;
template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}
template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? ELEM_SEPARATION : "");} return o;}
template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? VEC_SEPARATION : "");} return o;}
template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}
template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}
template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}
template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}
ll floor(ll a, ll b){if(b < 0) a = -a, b = -b; return a >= 0 ? a/b : (a+1)/b - 1;}
ll ceil (ll a, ll b){if(b < 0) a = -a, b = -b; return a > 0 ? (a-1)/b + 1 : a/b;}
ll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}
// ================================== ここまでテンプレ ==================================

// return cosA (Aはaの向かい側)
double cosine_formula(double a, double b, double c){
    return acos((b*b + c*c - a*a) / (2*b*c));
}

double distance(double x1, double y1, double x2, double y2){
    return sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));
}

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll a, b, c; cin >> a >> b >> c;
    for(int bc2 = (b-c)*(b-c); bc2 <= (b+c)*(b+c); bc2++){
        ll bc = sqrt(bc2);
        if(bc*bc != bc2) continue;
        // (b, c, bc) が三角形を作ることができるか
        if(b + c <= bc) continue;
        if(c + bc <= b) continue;
        if(bc + b <= c) continue;

        // B(0, 0), C(bc, 0) とする
        // A(ax, ay) としてこれを求める
        double phi = cosine_formula(c, b, bc);
        double ax = b * cos(phi);
        double ay = sqrt(b*b - ax*ax);

        // Dの位置を全探索する
        for(int dx = 1; dx + a < bc; dx++){
            double ad = distance(ax, ay, dx, 0);
            double ae = distance(ax, ay, dx+a, 0);
            double bd = distance(0, 0, dx, 0);
            double ec = distance(dx+a, 0, bc, 0);
            double theta1 = cosine_formula(bd, ad, b);
            double theta2 = cosine_formula(ec, ae, c);

            if(abs(theta1 - theta2) < 1e-6){
                cout << "Yes" << endl;
                return 0;
            }
        }
    }

    cout << "No" << endl;
    return 0;
}