text: #include <cmath>
  #include <cctype>
  #include <cstdio>
  #include <cstring>
  #include <set>
  #include <map>
  #include <stack>
  #include <queue>
  #include <string>
  #include <vector>
  #include <iomanip>
  #include <iostream>
  #include <algorithm>
  #define fn "testdata"
  #define ll long long
  #define int long long
  #define pc(x) putchar(x)
  #define endln putchar(';\n';)
  #define println(x) print(x), endln
  #define fileIn freopen("testdata.in", "r", stdin)
  #define fileOut freopen("testdata.out", "w", stdout)
  #define rep(i, a, b) for (int i = (a); i <= (b); ++i)
  #define per(i, a, b) for (int i = (a); i >= (b); --i)
  #ifdef yyfLocal
  #define dbg(x) std::clog << #x" = " << (x) << std::endl
  #define logs(x) std::clog << (x) << std::endl
  #else
  #define dbg(x) 42
  #define logs(x) 42
  #endif
  
  int read() {
      int res = 0, flag = 1; char ch = getchar();
      while (!isdigit(ch)) { if (ch == ';-';) flag = -1; ch = getchar(); }
      while (isdigit(ch)) res = res * 10 + ch - 48, ch = getchar();
      return res * flag;
  }
  
  void print(int x) {
      if (x < 0) putchar(';-';), x = -x;
      if (x > 9) print(x / 10);
      putchar(x % 10 + 48);
  }
  
  int a[25];
  
  void solution() {
      std::set<int> set;
      int n = read(); a[1] = read();
      set.insert(a[1]); set.insert(360 - a[1]);
      rep(i, 2, n) {
          a[i] = read(); std::set<int> tmp;
          for (auto &j : set) tmp.insert((j + a[i]) % 360), tmp.insert(((j - a[i]) % 360 + 360) % 360);
          set = tmp;
      }
      puts(set.find(0) != set.end() ? "YES" : "NO");
  }
  
  signed main() {
  #ifdef yyfLocal
      fileIn;
      // fileOut;
  #else  
  #ifndef ONLINE_JUDGE   
      freopen(fn ".in", "r", stdin);
      freopen(fn ".out", "w", stdout);
  #endif
  #endif
      logs("main.exe");
      solution();
  }
  
  // Luogu Ranking Comparator
  // Luogu Records Comparator