#include <bits/stdc++.h>
using namespace std;
const int mod = 360;
int sum;
vector<pair<int, int> > ele;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    ele.push_back({x, -x});
    sum += x;
  }
  if (sum % 2)
    return cout << "NO" << endl, 0;
  else {
    vector<int> tobi(n, 0);
    int p = n - 1;
    while (p >= 0) {
      for (int j = 0; j < pow(2, n); j++) {
        int s = 0;
        for (int i = 0; i < n; i++) {
          if (tobi[i])
            s += ele[i].first;
          else
            s += ele[i].second;
        }
        if (s == 0 or s % mod == 0) return cout << "YES" << endl, 0;
        next_permutation((tobi).begin(), (tobi).end());
      }
      tobi[p--] = 1;
    }
    cout << "NO" << endl;
  }
  return 0;
}
