#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[29];
inline int read() {
  int x = 0, sign = 1;
  char ch;
  while (ch < '0' || ch > '9') ch = getchar(), sign = (ch == '-') ? -1 : sign;
  while (ch >= '0' && ch <= '9')
    x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
  return x * sign;
}
inline long long readll() {
  long long x = 0, sign = 1;
  char ch;
  while (ch < '0' || ch > '9') ch = getchar(), sign = (ch == '-') ? -1 : sign;
  while (ch >= '0' && ch <= '9')
    x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
  return x * sign;
}
inline void write(long long x) {
  if (x == 0)
    putchar(48);
  else {
    static char w[29];
    static int t = 0;
    if (x < 0) putchar('-'), x = -x;
    while (x) w[++t] = 48 ^ (x % 10), x /= 10;
    while (t) putchar(w[t--]);
  }
}
void dfs(int cur, int pos) {
  if (cur == n + 1) {
    if (pos == 0) {
      printf("YES\n");
      exit(0);
    }
    return;
  }
  dfs(cur + 1, ((pos + a[cur]) % 360 + 360) % 360);
  dfs(cur + 1, ((pos - a[cur]) % 360 + 360) % 360);
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  dfs(1, 0);
  printf("NO\n");
  return 0;
}
