#include using namespace std; #define F first #define S second #define R cin>> #define ln cout<<'\n' #define ll long long #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.12f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) ll check(ll n,ll m,ll x,ll y){return x>=0&&x=0&&yvoid pr(const A &a,const B&...b){cout<void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")< P; ll dp[2][6005][2][2],d[5005]; void Main() { ll n; cin >> n; ll t=0; rep(i,n) { ll x; R x; d[x]++; t^=x; } dp[0][0][0][0]=1; ll r=0; rep(i,5001) { rep(j,6001) { rep(l,2) { rep(l2,2) { rep(k,min(5LL,d[i]+1)) { if(!dp[r][j][l][l2]) continue; ll e=d[i]-k; dp[r^1][j^(k%2?i:0)][max(l,(ll)(k>0))][max(l2,(ll)(e>0))]|=1; } } } } mem(dp[r]); r^=1; } if(dp[r][t][1][1]) pr("Yes"); else pr("No"); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}