#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e5 + 5;
const long long INF = 1e9 + 5;
const long long MOD = 1e8;
long long n;
long long a[20];
long long dp[20][400];
bool check(long long ndx, long long deg) {
  if (ndx > n) return false;
  if (ndx == n && deg == 0) return true;
  return (
      check(ndx + 1, (deg + a[ndx]) % 360) |
      check(ndx + 1, (deg - a[ndx] < 0 ? 360 + deg - a[ndx] : deg - a[ndx])));
}
void solve(long long ndx) {
  cin >> n;
  memset(dp, -1, sizeof dp);
  for (int i = 0; i < n; i++) cin >> a[i];
  if (check(0, 0))
    cout << "YES";
  else
    cout << "NO";
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long t = 1;
  long long ndx = 1;
  while (t--) {
    solve(ndx++);
  }
  return 0;
}
