#include<bits/stdc++.h>

using namespace std;

#define rg register
#define In inline
#define ll long long

const ll mod = 998244353;
const int N = 2e5;

namespace IO{
	In ll read(){
		ll s = 0,ww = 1;
		char ch = getchar();
		while(ch < '0' || ch > '9'){if(ch == '-')ww = -1;ch = getchar();}
		while('0' <= ch && ch <= '9'){s = 10 * s + ch - '0';ch = getchar();}
		return s * ww;
	}
	In void write(ll x){
		if(x < 0)putchar('-'),x = -x;
		if(x > 9)write(x / 10);
		putchar('0' + x % 10);
	}
};
using namespace IO;

namespace ModCalc{
	In void Inc(ll &x,ll y){
		x += y;if(x >= mod)x -= mod;
	}
	In void Dec(ll &x,ll y){
		x -= y;if(x < 0)x += mod;
	}
	In ll Add(ll x,ll y){
		Inc(x,y);return x;
	}
	In ll Sub(ll x,ll y){
		Dec(x,y);return x;
	}
};
using namespace ModCalc;

ll a[N+5];
int n;

int main(){
//	freopen("B.in","r",stdin);
//	freopen("B.out","w",stdout);
	n = read();
	for(rg int i = 1;i <= n;i++)a[i] = read();
	sort(a + 1,a + n + 1);
	ll x = 0,ans = 0;
	for(rg int i = 1;i <= n;i++){
		Inc(ans,Add(x,a[i]) * a[i] % mod);
		x = Add(x * 2 % mod,a[i]);
	}
	write(ans),putchar('\n');
	return 0;
}
#include <iostream>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <string>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <utility>
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vl vector<long long>
#define vpl vector<pair<long long, long long>>
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
template<typename T>
void printVector(const T& t) {
    std::copy(t.cbegin(), t.cend(), std::ostream_iterator<typename T::value_type>(std::cout, ", "));
}
using namespace std;
using ll = long long;
const int mode = 0;


void solve() {
  int a, b, c, d;
  cin >> a >> b >> c >> d;
  int t = a + b + c + d;
  if (t % 2) {
    cout << "No\n";
    return;
  }
  int h = t / 2;
  vi ways = {a,b,c,d,a+b,a+c,a+d};
  for (int x : ways) {
    if (x == h) {
      cout << "Yes\n";
      return;
    }
  }
  cout << "No\n";
}



int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int t;

  if (mode == 0) { 
    solve();
  } else {
    cin >> t;
    while (t--) {
      solve();
    }
  }
}
