/* -*- coding: utf-8 -*-
 *
 * 1594.cc:  No.1594 Three Classes - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 12;
const int NBITS = 1 << MAX_N;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

int es[MAX_N], ess[NBITS], bs[NBITS];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", es + i);

  int nbits = 1 << n, nmsk = nbits - 1;
  for (int bits = 1, msb = 1, msi = 0; bits < nbits; bits++) {
    if ((msb << 1) <= bits) msb <<= 1, msi++;
    ess[bits] = ess[bits ^ msb] + es[msi];
  }

  if (ess[nmsk] % 3 != 0) { puts("No"); return 0; }
  int s3 = ess[nmsk] / 3;

  int m = 0;
  for (int bits = 0; bits < nbits; bits++)
    if (ess[bits] == s3) bs[m++] = bits;
  //printf("m=%d\n", m);

  for (int i = 0; i < m; i++)
    for (int j = i + 1; j < m; j++)
      if ((bs[i] & bs[j]) == 0) {
	int bij = bs[i] | bs[j];
	for (int k = j + 1; k < m; k++)
	  if ((bij & bs[k]) == 0 && (bij | bs[k]) == nmsk) {
	    puts("Yes"); return 0;
	  }
      }

  puts("No");
  return 0;
}