#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int n;
int a[20];
int dp[20][500];
int get(int i = 0, int sum = 0) {
  if (i == n) return (sum == 0);
  int &ret = dp[i][sum];
  if (ret + 1) return ret;
  ret = 0;
  ret += get(i + 1, (sum + a[i] + 360) % 360);
  ret += get(i + 1, (sum - a[i] + 360) % 360);
  return ret;
}
int main() {
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> a[i];
  memset(dp, -1, ((int)(sizeof(dp))));
  cout << (get() > 0 ? "YES\n" : "NO\n");
  return 0;
}
