#include <bits/stdc++.h>   using namespace std;   signed main() {     int n;     cin >> n;     int ar[n];     for (int i = 0; i < n; i++) cin >> ar[i];     int max_n = pow(2, n);     bool ans = false;     for (int i = 0; i < max_n; i++) {       int temp = i;       int val = 0;       for (int j = 0; j < n; j++) {         if (temp & 1) {           val = (val + ar[j]) % 360;         } else {           val = (val - ar[j] + 360) % 360;         }         temp = temp >> 1;       }       if (val == 0) {         ans = true;         break;       }     }     if (ans) {       cout <<  YES n ;     } else {       cout <<  NO n ;     }     return 0;   }   