#include <bits/stdc++.h>
using namespace std;
const long long int Mod = 998244353;
const long long int mod = 1e9 + 7;
long long int Pow(long long int a, long long int b) {
  a = a % mod;
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return (res % mod);
}
long long int modInverse(long long int a, long long int m) {
  long long int m0 = m;
  long long int y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long int q = a / m;
    long long int t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
bool isSum(int set[], int n, int sum) {
  bool subset[n + 1][sum + 1];
  for (int i = 0; i <= n; i++) subset[i][0] = true;
  for (int i = 1; i <= sum; i++) subset[0][i] = false;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= sum; j++) {
      if (j < set[i - 1]) subset[i][j] = subset[i - 1][j];
      if (j >= set[i - 1])
        subset[i][j] = subset[i - 1][j] || subset[i - 1][j - set[i - 1]];
    }
  }
  return subset[n][sum];
}
void solve() {
  int n;
  cin >> n;
  int arr[n];
  int sum = 0;
  for (int i = 0; i <= n - 1; i++) {
    cin >> arr[i];
    sum += arr[i];
  }
  bool b = false;
  int k = Pow(2, n);
  for (int i = 0; i <= k - 1; i++) {
    int val = i;
    int j = 0;
    int tot = sum;
    while (val != 0) {
      if (val % 2 == 0) tot -= 2 * arr[j];
      val /= 2;
      j++;
    }
    if (tot % 360 == 0) b = true;
  }
  if (b == true)
    cout << "YES";
  else
    cout << "NO";
}
int main() {
  solve();
  return 0;
}
