import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum LIM = 10^^4;

alias Rat = Tuple!(long, "p", long, "q");

Rat add(Rat a, Rat b) {
  return Rat(a.p * b.q + b.p * a.q, a.q * b.q);
}
Rat sub(Rat a, Rat b) {
  return Rat(a.p * b.q - b.p * a.q, a.q * b.q);
}
Rat mul(Rat a, Rat b) {
  return Rat(a.p * b.p, a.q * b.q);
}
Rat div(Rat a, Rat b) {
  return Rat(a.p * b.q, a.q * b.p);
}

int N;
long[] A;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      auto dp = new Rat[][1 << N];
      foreach (i; 0 .. N) {
        dp[1 << i] = [Rat(A[i], 1)];
      }
      foreach (s; 1 .. 1 << N) {
        if (popcnt(s) <= max(2, N - 2)) {
          for (int t = s; --t &= s; ) {
            if (t < (s ^ t)) {
              foreach (x; dp[t]) foreach (y; dp[s ^ t]) {
                dp[s] ~= add(x, y);
                dp[s] ~= sub(x, y);
                dp[s] ~= sub(y, x);
                dp[s] ~= mul(x, y);
                if (y.p != 0) {
                  dp[s] ~= div(x, y);
                }
                if (x.p != 0) {
                  dp[s] ~= div(y, x);
                }
              }
            }
          }
        }
        dp[s] = dp[s].sort.uniq.array;
      }
      debug {
        writeln("max |dp[*]| = ", dp.map!"a.length".maxElement);
      }
      foreach (s; 1 .. 1 << N) {
        foreach (ref x; dp[s]) {
          const g = gcd(abs(x.p), abs(x.q));
          x.p /= g;
          x.q /= g;
          if (x.q < 0) {
            x.p *= -1;
            x.q *= -1;
          }
        }
        dp[s] = dp[s].sort.uniq.array;
      }
      bool ans;
      foreach (s; 1 .. 1 << N) foreach (t; 1 .. 1 << N) {
        if (!(s & t) && !dp[s].empty && !dp[t].empty) {
          foreach (y; dp[t]) {
            const pos = dp[s].lowerBound(y);
            if (pos < dp[s].length && dp[s][pos] == y) {
              ans = true;
            }
          }
        }
      }
      writeln(ans ? "YES" : "NO");
    }
  } catch (EOFException e) {
  }
}