#include <bits/stdc++.h>
using namespace std;
const int N = 20;
const int M = 360;
int n, a[N];
bool f[N][M];
int main() {
  int i, j;
  cin >> n;
  for (i = 1; i <= n; ++i) cin >> a[i];
  f[0][0] = true;
  for (i = 1; i <= n; ++i) {
    for (j = 0; j < M; ++j) {
      f[i][j] = (f[i - 1][(j + a[i]) % M] | f[i - 1][((j - a[i]) % M + M) % M]);
    }
  }
  if (f[n][0])
    puts("YES");
  else
    puts("NO");
  return 0;
}
