OLOLO - Onotole needs your help


Onotole has a lot of pyani. Each pyani has a number, writing on it. Pyanis with equal numbers are indistinguishable. Onotole knows everything, so, he knows that each pyani appeared twice, and only one pyani is unique. He wants to get вздръжни эффект, and he needs the unique pyani. Given the list of pyanis denote which one of them appeared once (it is guaranteed that other pyanis appeared twice).

Input

First line of input contains number of pyanis N <= 500 000. Next N lines contain a single positive integer 1 <= Pi <= 10^9.

Output

Output one positive integer on pyani, which appeared once.

Example

Input:
3
1
8
1

Output: 8

Onotole has found not optimal AC algorithms, so all solutions will be rejudged. He is watching you.


hide comments
shivam: 2015-10-10 18:14:28

if using cin or cout,set sync_with_stdio(false);
cin.tie(NULL);

nap11: 2015-10-07 16:27:05

is this possible in java?

DeviSree: 2015-09-26 18:03:58

same sol TLE in python anyway nice question

Sarthak Munshi: 2015-09-20 13:17:29

ridiculous problem statement !

arabh_20: 2015-09-19 09:13:49

xor method is easier ....way...

MSK: 2015-09-18 04:26:54

did it in java tle :(
same in c ac... Not fair for java...

Mohit: 2015-09-16 05:39:29

this question is really taught new thing..

: 2015-09-11 15:28:53

50th problem :D

Prakhar Dev Gupta: 2015-09-11 11:01:05

1 1 2 3 4 will fetch what output and y?

Abishek: 2015-09-09 13:45:20

fast i/o needed . cost me two TLEs ..


Added by:Efim
Date:2010-11-04
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64