#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007ll;
long long arr[20];
long long n;
long long flag = 0;
void dfs(long long ind, long long value) {
  if (ind == n) {
    if (value % 360 == 0) flag = 1;
    return;
  }
  dfs(ind + 1, value + arr[ind]);
  dfs(ind + 1, value - arr[ind]);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> arr[i];
  dfs(0, 0);
  if (flag)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
