tjut 2509

#include<stdio.h>
int a[105];
int main()
{
    int i,ans,n,temp;
    while(scanf("%d",&n)!=EOF)
    {
        temp=0;//孤单堆
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            if(i==0)
                ans=a[i];
            else
                ans=ans^a[i];
            if(a[i]>1)  temp=1;
        }
        if(temp==0)
        {
            if(n%2==1)
               printf("No\n");
            else
               printf("Yes\n");
            continue;
        }         
        if(ans==0)
           printf("No\n");
        else
           printf("Yes\n");
    }    
    return 0;
}