#include <bits/stdc++.h>
using namespace std;
bool bit_set(long long j, long long i) {
  long long mask = 1 << j;
  return (mask & i);
}
int main() {
  long long n, x;
  bool full = false;
  cin >> n;
  long long arr[n];
  for (long long i = 0; i < n; i++) {
    cin >> x;
    arr[i] = x;
  }
  for (long long i = 0; i < (1 << n); i++) {
    long long s = 0;
    for (long long j = 0; j < n; j++) {
      if (bit_set(j, i)) {
        s += arr[j];
      } else {
        s -= arr[j];
      }
    }
    s = ((s % 360) + 360) % 360;
    if (s == 0) {
      full = true;
      break;
    }
  }
  if (full == true)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
