import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
int[] A;

bool solve() {
  int sum;
  foreach (i; 0 .. N) {
    sum ^= A[i];
  }
  if (sum != 0) {
    return false;
  }
  int[] bs;
  foreach (i; 0 .. N - 1) {
    int a = A[i];
    foreach (b; bs) {
      chmin(a, a ^ b);
    }
    if (a) {
      bs ~= a;
    } else {
      return true;
    }
  }
  return false;
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt;
      }
      
      const ans = solve;
      writeln(ans ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}