Unique Element Finder

Given an integer array where every element appears exactly twice except for one, your task is to find the unique element that appears only once. You can solve this problem efficiently using the properties of XOR, since \( a \oplus a = 0 \) and \( 0 \oplus a = a \). This allows you to perform the computation in linear time.

inputFormat

The input consists of two lines. The first line contains a single integer \( n \), representing the number of elements in the array. The second line contains \( n \) space-separated integers. It is guaranteed that every element appears exactly twice except for one.

outputFormat

Output the unique integer that appears exactly once.

5
2 3 2 4 4

3