CF 2019 B

#include<bits/stdc++.h>
#include<cmath>
using namespace std;
int main()
{
    int n,w[30],i,j;
    int total=0,ps,temto,diff;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&w[i]);
        total=total+w[i];
    }
    ps=pow(2,n);
    for(i=0;i<ps-1;i++){
        temto=0;
        for(j=0;j<n;j++){
            if(i&(1<<j)){
                temto=temto+w[j];
            }
        }
        diff=total-temto;
        diff=abs(temto-diff);
        if(diff%360==0){
            printf("YES\n");
            return 0;
        }
    }
    printf("NO\n");
    return 0;
}