#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
int n;
int a[maxn];
bool flag;
void Dfs(int sum, int cur) {
  if (cur == n + 1 || flag) {
    if (sum % 360 == 0 || sum == 0) flag = true;
    return;
  }
  Dfs(sum + a[cur], cur + 1);
  Dfs(sum - a[cur], cur + 1);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i);
  flag = false;
  Dfs(0, 1);
  printf("%s\n", flag ? "YES" : "NO");
  return 0;
}
