#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long power(long long a, long long b) {
  long long result = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      result *= a;
    }
    a *= a;
    b /= 2;
  }
  return result;
}
long long countSetBits(long long x) {
  long long Count = 0;
  while (x > 0) {
    if (x & 1) Count++;
    x = x >> 1;
  }
  return Count;
}
bool isPerfectSquare(long long n) {
  long long sr = sqrt(n);
  if (sr * sr == n)
    return true;
  else
    return false;
}
long long mod(long long x, long long M) { return ((x % M + M) % M); }
long long mul(long long a, long long b, long long M) {
  return mod(mod(a, M) * mod(b, M), M);
}
long long powerM(long long a, long long b, long long M) {
  long long res = 1ll;
  while (b) {
    if (b % 2ll == 1ll) {
      res = mul(a, res, M);
    }
    a = mul(a, a, M);
    b /= 2ll;
  }
  return res;
}
int log22(long long x) { return 64 - __builtin_clzll(x) - 1; }
void SieveOfEratosthenes(vector<bool>& mem) {
  long long n = 1e6 + 1;
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (long long i = 2; i < n; i++)
    if (prime[i]) mem[i] = true;
}
int n;
vector<int> v;
bool flag = 0;
void solve(int sum, int i) {
  if (i > n) return;
  if (i == n && (sum % 360 == 0)) {
    flag = 1;
    return;
  }
  solve(sum + v[i], i + 1);
  solve(sum - v[i], i + 1);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (long long i = 0; i < n; i++) {
    int x;
    cin >> x;
    v.push_back(x);
  }
  solve(0, 0);
  if (flag)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
