#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)

int cmkt(vector<ll> v){
	sort(v.begin(),v.end());
	return v.at(0)+v.at(1)>v.at(2);
}

int main(){
	ll a,b,c;
	cin>>a>>b>>c;
	for(ll l=1;l<=100;l++){
		for(ll r=1;r<=100;r++){
			ll sa=l+a+r;
			if(!cmkt({sa,b,c})) continue;
			ll tmp1=(a*l*c-l*r*b+l*l*c)*c;
			ll tmp2=(a*r*b+r*r*b-l*r*c)*b;
			tmp1*=tmp1;
			tmp2*=tmp2;
			tmp1*=(2*b*sa)*(2*b*sa)-(b*b+sa*sa-c*c)*(b*b+sa*sa-c*c);
			tmp2*=(2*c*sa)*(2*c*sa)-(c*c+sa*sa-b*b)*(c*c+sa*sa-b*b);
			if(tmp1==tmp2){
				cout<<"Yes\n";
				return 0;
			}
		}
	}
	cout<<"No\n";
}