import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
// dfmt on

void main()
{
    long N = lread();
    auto A = aryread!ulong();
    auto sorted = A.sort();
    foreach (i; 0 .. N)
    {
        outer: foreach (j; i + 1 .. N)
        {
            auto B = new bool[](N);
            B[i] = true;
            B[j] = true;
            auto n = sorted[i];
            auto m = sorted[j];
            foreach (k; 0 .. N - 2)
            {
                auto o = n ^ m;
                auto idx = sorted.lowerBound(o).length;
                while (sorted[idx] == o && B[idx])
                    idx++;
                if (sorted[idx] == o)
                {
                    B[idx] = true;
                    n = m;
                    m = sorted[idx];
                }
                else
                {
                    continue outer;
                }
            }
            if ((n ^ m ^ sorted[i]) == 0)
            {
                writeln("Yes");
                return;
            }
        }
    }
    writeln("No");
}
