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
[Mayank Pratap]:
20150506 18:27:41
Its good to make progress day by day,learning new things ........Meanwhile I was wondering what Mitch and Francky are talking about :P 

Kishore H Patel:
20150416 19:49:21
For JAVA user's "chully bhar pani mein doob maro" => It's not your cup of tea 

Prasanna Patil:
20150414 04:04:39
Nice problem...


bholagabbar:
20150413 21:43:29
Alright so this code in almost impossible to solve in the given constraints in java. Atleast by the method i used to solve it in C++ with fast IO (http://codeforces.com/blog/entry/6251). I got TLE without the thing mentioned in the link and AC with it.


arjun:
20150413 17:28:20
Whatever language you use. Just perform faster io operations.


MD:
20150402 21:53:39
great concept!! new thing to learn.. Last edit: 20150402 21:54:31 

.:: Jarv1s ::.:
20150315 19:06:30
Learned a new thing! 

Francky:
20150203 19:08:28
The issue seems solved.

Added by:  Efim 
Date:  20101104 
Time limit:  0.134s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 