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).


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


Output one positive integer on pyani, which appeared once.



Output: 8

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

hide comments
Fodor Gabor: 2017-01-31 19:17:35

Python gets TLE, even for O(N) solution.
For Java, using Scanner for I/O also gives TLE, use BufferedReader instead.
For C++, see comments.

singhaljoy: 2017-01-22 12:10:18

Use property of XOR, AC in 1 go!!!

shantanu_sarin: 2017-01-20 13:55:34

cin cout gives TLE
use scanf printf
cost me 4 WA

scorpion_ajay: 2017-01-12 12:02:12

easiest till :p

coder_with_a_h: 2017-01-01 17:18:59

cin and cout gives TLE
use scanf and printf !!!!!

vunnamtej: 2016-12-29 18:11:31

@apurvgs thanks for your comment

rohitkr2997: 2016-12-29 14:06:25

ios_base::sync_with_stdio (false);cin.tie(0); as first statement of main function. Use property of x^x=0 and x^0=x.

hasan356: 2016-12-28 07:12:40

AC in one go!!Use Xor

apurvgs: 2016-12-14 06:48:33

cin and cout gives TLE
use scanf and printf
very easy using bitmap

rakeshgupta: 2016-12-13 11:33:09

@julkas what is "and ... 5 L. BR.??". Sorry, but i am a beginner in python, so not so well in acronyms (if it is one).

Last edit: 2016-12-13 11:37:24

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