#include #include using namespace std; using namespace atcoder; using mint = modint998244353; const int mod = 998244353; //using mint = modint1000000007; //const int mod = 1000000007; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; if (n > 5000) { cout << "Yes" << endl; return 0; } vector dp(n + 1, vector(1 << 13)); dp[0][0] = 1; int sum = 0; rep(i, n) { int a; cin >> a; sum ^= a; rep(j, 1 << 13) { dp[i + 1][j] += dp[i][j]; dp[i + 1][j^a] += dp[i][j]; } rep(j, 1 << 13)chmin(dp[i + 1][j], 3); } if (0 == sum)dp[n][0] -= 2; else dp[n][0]--; cout << (dp[n][0] ? "Yes" : "No") << endl; return 0; }