#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  int k = pow(2, n);
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  for (int i = 0; i < k; i++) {
    int tmp = i;
    int counter = 0;
    for (int j = 0; j < n; j++) {
      if (tmp % 2 == 0)
        counter += v[n - 1 - j];
      else
        counter = (counter + 360 - v[n - 1 - j]) % 360;
      tmp /= 2;
    }
    if (counter % 360 == 0) {
      puts("YES");
      return;
    }
  }
  puts("NO");
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
}
