#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#include <bitset>
#pragma warning(disable:4996) 

//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
//const long long MOD = 1000000007;
const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif



void solve()
{
    int n;
    scanf("%d", &n);
    vector<int> a(n);
    int s = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
        s += a[i];
    }
    if (s % 3) {
        printf("No\n"); return;
    }
    s = s / 3;

    for (int i = 0; i < (1LL << n); i++) {
        int s0 = 0;
        vector<int> v;
        for (int k = 0; k < n; k++) {
            if (i & (1LL << k)) {
                s0 += a[k];
                continue;
            }
            v.push_back(k);
        }
        if (s != s0) {
            continue;
        }
        int num = (int)v.size();
        
        for (int j = 0; j < (1LL << num); j++) {
            int s1 = 0;
            for (int k = 0; k < num; k++) {
                if (j & (1LL << k)) {
                    continue;
                }
                s1 += a[v[k]];
            }
            if (s1 == s) {
                printf("Yes\n"); return;
            }
        }
    }
    printf("No\n");

    return;
}

int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}