#include <bits/stdc++.h>
using namespace std;
int cinn() {
  int x;
  scanf("%d", &x);
  return x;
}
long long scll() {
  long long x;
  scanf("%lld", &x);
  return x;
}
double scd() {
  double x;
  scanf("%lf", &x);
  return x;
}
void coutt(int x) { printf("%d ", x); }
const int mod = 1e9 + 7;
const int inf = (int)2e9 + 5;
const long long int Inf = (long long int)1e18 + 5;
const int N = 1e6 + 5;
const int nn = 3e5 + 5;
int a[nn];
int t[nn];
int solve() {
  int n, sum = 0;
  cin >> n;
  int a[n + 1];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    sum += a[i];
  }
  for (int mask = 0; mask < (1 << n); mask++) {
    long long int sum_of_two_subset = 0;
    for (int i = 0; i < n; i++) {
      if (mask & (1 << i)) {
        sum_of_two_subset += a[i];
      } else {
        sum_of_two_subset -= a[i];
      }
    }
    if (sum_of_two_subset == 0 || sum_of_two_subset % 360 == 0) {
      cout << "Yes" << endl;
      return 0;
    }
  }
  cout << "No" << endl;
  return 0;
}
int main() {
  int test = 1, tc = 0;
  while (test--) {
    solve();
  }
  return 0;
}
