/*
2021-04-15 03:44:57.635786
Category: cumsum
Rating: x
*/
/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
#include<bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define int long long
#define ll long long
#define ld long double
#define gap ' '
#define endl '\n'

void solve(int testcase) {
	int n; cin>>n;
	vector<int> v(n+1),p(n+1,0);
	for(int i=1;i<=n;i++) cin>>v[i];
	sort(v.begin()+1,v.end(),greater<int>());
	for(int i=1;i<=n;i++) p[i]=p[i-1]+v[i];
	int sum=0;
	for(int i=1;i<=n-1;i++) {
		sum+=(n-i)*v[i]-(p[n]-p[i]);
	}
	cout<<sum<<endl;
}

int32_t main() {
	fio
	int T=1;
	//cin>>T;
	for(int t=1;t<=T;t++) solve(t);
	return 0;
}
#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repr(i, n) for(int i = (n-1); i >= 0; --i)

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

typedef long long ll;
typedef pair<int, int> P;

const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;

int main(){
    int x[4];
    rep(i, 4) cin >> x[i];

    int S = 0;
    rep(i, 4) S += x[i];

    rep(i, 1<<4) {
        int t = 0;
        rep(j,4) {
            if (i>>j&1) t += x[j];
        }
        if (t == S-t) {
            puts("Yes");
            return 0;
        }
    }

    puts("No");
}