#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long int n) {
  if (n <= 1) return 0;
  for (long long int i = 2; i * i <= n; i++)
    if (n % i == 0) return 0;
  return 1;
}
long long int min(long long int a, long long int b) {
  if (a > b)
    return b;
  else
    return a;
}
long long int max(long long int a, long long int b) {
  if (a > b)
    return a;
  else
    return b;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  if (b == 0) return a;
  if (a == b) return a;
  if (a > b) return gcd(a - b, b);
  return gcd(a, b - a);
}
long long int countfreq(long long int a[], long long int n, long long int sum) {
  long long int c = 0, i = 0, j = n - 1;
  while (i < j) {
    long long int s = a[i] + a[j];
    if (s == sum) {
      i++;
      j--;
      c++;
    }
    if (s < sum) i++;
    if (s > sum) j--;
  }
  return c;
}
long long int phi(long long int n) {
  float result = n;
  for (long long int p = 2; p * p <= n; ++p) {
    if (n % p == 0) {
      while (n % p == 0) n /= p;
      result *= (1.0 - (1.0 / (float)p));
    }
  }
  if (n > 1) result *= (1.0 - (1.0 / (float)n));
  return (long long int)result;
}
bool f = 0;
long long int a[20], n;
void func(long long int ind, long long int sum) {
  if (ind == n) {
    if (sum % 360 == 0) f = 1;
    return;
  }
  func(ind + 1, sum + a[ind]);
  func(ind + 1, sum - a[ind]);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (long long int i = 0; i < n; i++) cin >> a[i];
  func(0, 0);
  if (f)
    cout << "YES";
  else
    cout << "NO";
}
