$\newcommand{\xor}[0]{\oplus}$
XOR is commutative, associative and self-inverse. We further have that $a\xor b=0 \Leftrightarrow a=b$ (by comparing them bit for bit).
That means
$$
a_1\xor ...\xor a_n
\\ = a_1\xor ...\xor a_{i-1}\xor a_{i+1} \xor ...\xor a_n\xor a_i
\\ = a_1\xor ...\xor a_{i-1}\xor a_{i+1} \xor ...\xor a_n\xor a_i
\\ =( a_1\xor ...\xor a_{i-1}\xor a_{i+1} \xor ...\xor a_n)\xor a_i
$$
Now if we add $a_i$, we get
$$
( a_1\xor ...\xor a_{i-1}\xor a_{i+1} \xor ...\xor a_n)\xor a_i \xor a_i
\\=
( a_1\xor ...\xor a_{i-1}\xor a_{i+1} \xor ...\xor a_n)
$$
because $x\xor a_i\xor a_i = x$ for all $x$ because XOR is self-inverse.
Now assume $a_1\xor ...\xor a_n=c$. Then if $a_n\neq c$, we have again because XOR is self-inverse that
$$
a_1\xor ...\xor a_n=c
\\\Leftrightarrow\\
a_1\xor ...\xor a_n\xor a_n=c\xor a_n
\\\Leftrightarrow\\
a_1\xor ...\xor a_{n-1} \neq 0
$$
Inversely that means that for example for $c\xor c\xor c$ we have $c\xor c\xor c=c$, and no matter which we remove, we end up with $c\xor c=0$.
But since it was given that $n$ is even, if we had $a_1=...=a_n=c$, then $a_1\xor...\xor a_n=0$, which would be a contradiction to the requirement that at least one of the $a_i$ isn't 0.