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

int main(){
  int a, b, c;
  cin >> a >> b >> c;
  if(a + b == 2 * c || a + c == 2 * b || b + c == 2 * a)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define ff              first
#define ss              second
#define int 			long long
#define pb              push_back
#define mp              make_pair
#define mt              make_tuple
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define max_size        100000000
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define mod             1000000007
#define w(t)			int t; cin >> t; while(t--)
#define inf             1e3
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define range(a,b)      substr(a,b-a+1)
#define mina(a,b,c)		min(a, min(b, c))
#define maxa(a,b,c)		max(a, max(b, c))
#define endl 			'\n'
#define trace(x)        cerr<<#x<<": "<<x<<" "<<endl;
#define FIO             ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define FOR(x,y)		for(int i = x; i < y; i++)
#define oset 			tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

bool sortbysec(const pair<int,int> &a, const pair<int,int> &b){ return (a.second < b.second); } 

bool specsort(const pair<int,int> &a, const pair<int,int> &b){ 
	if(a.first == b.first) return (a.second < b.second);
	else return (a.first < b.first);
}
int64_t ceil_div(int64_t a, int64_t b) {if(a%b != 0){ return ((a/b)+1);} else{ return (a/b);}}

double max(double a, double b){ if(a >= b){ return a; } else{ return b; } }

double min(double a, double b){if(a <= b){return a;} else{return b;}}

bool modd(double a, double b){if(floor(a/b) == ceil(a/b)){return true;} return false;}

bool stringsort(const string &a, const string &b){return a.length() > b.length();}

int32_t main(){
	FIO;
	int a,b,c;
	cin >> a >> b >> c;
	if(a*a + b*b < c*c) cout << "Yes" << endl;
	else cout << "No" << endl;
    return 0;
}
