#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
inline void smax(int &x, int y) { x = max(x, y); }
inline void smin(int &x, int y) { x = min(x, y); }
ll gcd(ll a, ll b) { return ((b == 0) ? a : gcd(b, a % b)); }
int n;
vector<int> v;
int f = 0;
void solve(int i, ll sum) {
  if (i == n) {
    if (sum == 0) f = 1;
    return;
  }
  solve(i + 1, (sum + v[i]) % 360);
  sum = (sum - v[i] + 360) % 360;
  solve(i + 1, sum);
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  v.resize(n);
  for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
       i += 1 - 2 * ((0) > (n)))
    cin >> v[i];
  solve(0, 0);
  if (f)
    cout << "YES";
  else
    cout << "NO";
}
