#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const long long MOD = 1e9 + 7;
struct node {
  int sum, step;
} a, b;
int main() {
  bool flag = false;
  int n, deg[20];
  queue<node> que;
  cin >> n;
  for (int i = (1); i <= (n); i++) cin >> deg[i];
  a.sum = 0, a.step = 1;
  que.push(a);
  while (!que.empty()) {
    a = que.front();
    que.pop();
    if (a.step == n + 1 && !(a.sum % 360)) {
      flag = true;
      break;
    }
    if (a.step <= n) {
      b.sum = a.sum + deg[a.step];
      b.step = a.step + 1;
      que.push(b);
      b.sum = a.sum - deg[a.step];
      b.step = a.step + 1;
      que.push(b);
    }
  }
  if (flag)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
