#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

using namespace std;

typedef long long ll;

const int N=;

inline int read(){

    char c=getchar();int x=,f=;

    while(c<''||c>''){if(c=='-')f=-;c=getchar();}

    while(c>=''&&c<=''){x=x*+c-'';c=getchar();}

    return x*f;

}

int n,a[N];

bool solve(){

    int All=<<n;

    for(int s=;s<All;s++){

        int sg=;

        for(int i=;i<n;i++) if((<<i)&s) sg^=a[i];

        if(!sg) return true;

    }

    return false;

}

int main(){

    //freopen("in","r",stdin);

    int T=;

    while(T--){

        n=read();

        for(int i=;i<n;i++) a[i]=read();

        puts(solve() ? "NO" : "YES");

    }

}