#include <bits/stdc++.h>
#define ll long long
#define REP(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
int main(){
    vector <int> arr;
    int n=3;
    while(n--){
        int k;
        cin>>k;
        arr.push_back(k);
    }
    sort(arr.begin(),arr.end());
    if(arr[0]+arr[2]==2*arr[1]){
        cout<<"Yes"<<endl;
        return 0;
    }
    cout<<"No"<<endl;

return 0;
}
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int ll
using namespace __gnu_pbds;
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define endl "\n"
map<int,int> mp;
void solve()
{

int a,b,c;
cin>>a>>b>>c;
c*=c;
a*=a;
b*=b;
if(a+b<c)
{
    cout<<"Yes";
}
else
cout<<"No";





}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);


int  t;
t=1;
while(t--)
{
    solve();
}














    return 0;
}
///order_of_key (k) : Number of items strictly smaller than k .
///find_by_order(k) : K-th element in a set (counting from zero).