#include <bits/stdc++.h>
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
const long long int int_max = 1e18;
const long long int int_min = -1e18;
using namespace std;
void solve() {
  long long int n;
  cin >> n;
  long long int a[n + 2];
  for (long long int i = 0; i <= n - 1; i++) cin >> a[i];
  long long int sum = 0;
  long long int combinations = pow(2, n);
  int flg = 0;
  for (long long int i = 0; i <= combinations - 1; i++) {
    long long int sum = 0;
    for (long long int j = 0; j <= n - 1; j++) {
      long long int temp = (1 << j);
      if ((temp & i))
        sum += a[j];
      else
        sum -= a[j];
    }
    if (sum % 360 == 0) {
      flg = 1;
      break;
    }
  }
  if (flg)
    cout << "YES" << '\n';
  else
    cout << "NO" << '\n';
}
int main() {
  ios::sync_with_stdio(false), cin.tie(NULL);
  solve();
}
