330. Single Number

1

Easy

Given a non-empty array of integers, every element appears twice except for one. Find that element which appears only once.

Input Format

First line of input contains an integer N (size of array) followed by N integers (element of array)

Output Format

Print the element which appear only once.

Example

Input

5 4 4 1 1 2

Output

2

Constraints

0 < N <= 100000000
0 <= A[i] <= 10000000000
Loading...

View Submissions

Console