#include <bits/stdc++.h>
using namespace std;
int b[20][50000];
int main() {
  int n;
  int a[20];
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    memset(b, 0, sizeof(b));
    b[0][0] = 0;
    int g = 1;
    int k;
    for (int i = 1; i <= n; i++) {
      k = g;
      g = 0;
      for (int j = 0; j < k; j++) {
        b[i][g++] = b[i - 1][j] + a[i - 1];
        b[i][g++] = b[i - 1][j] - a[i - 1];
      }
    }
    int flag = 0;
    for (int i = 0; i < k; i++) {
      if (b[n][i] % 360 == 0) {
        flag = 1;
        break;
      }
    }
    if (flag == 1) {
      printf("YES\n");
    } else {
      printf("NO\n");
    }
  }
  return 0;
}
