#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
void fast() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
}
const long long mxN = 20, oo = 1e9, mod = 1e9 + 7;
int n;
int dp[mxN][4000], arr[mxN];
bool go(int i, int now) {
  if (i == n) return now % 360 == 0;
  int &ret = dp[i][now];
  if (~ret) return ret;
  ret = 0;
  if (now - arr[i] >= 0) ret = go(i + 1, (now - arr[i]));
  return ret = ret | go(i + 1, (now + arr[i]));
}
int solve() {
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> arr[i];
  for (int i = 0; i < (1 << n); i++) {
    long long sum = 0;
    for (long long j = 0; j < n; j++) {
      if (i & (1 << j))
        sum += arr[j];
      else
        sum -= arr[j];
    }
    if (sum % 360 == 0)
      return cout << "YES"
                  << "\n",
             0;
  }
  cout << "NO"
       << "\n";
}
int main() {
  fast();
  solve();
}
