Commit-X Question 3

Problem Statement

Given an array of N integers, every number in the array appears twice except for one. Find and return the single number that appears only once.

Example Test Cases

Test Case 1

Input

3
2 2 1

Output

1

Test Case 2

Input

5
4 1 2 1 2

Output

4