Find the Unique Element

Given a list of integers in which every integer appears exactly twice except for one, your task is to identify the unique integer that appears only once. You can make use of the following bitwise XOR properties:

• \(a \oplus a = 0\)
• \(a \oplus 0 = a\)

Use these properties to design an efficient algorithm for solving the problem.

inputFormat

The input consists of two lines:

- The first line contains a single integer \(n\), which is the number of elements in the list.

- The second line contains \(n\) space-separated integers.

outputFormat

Output a single integer — the unique integer that appears only once in the list.

7
4 3 2 4 1 3 2

1