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
Timmy Jose: 2015-12-12 16:04:40

@Sumit Suthar

Mate, you really shouldn't leave the answer for other people to accidentally stumble upon. Thankfully I figured this out and then checked the comments (as I always do now - SPOJ really should have the comments collapsed, by the way). If SPOJ had a feature to report people, I'd report you in a heartbeat. Stop being a tool.

Timmy Jose: 2015-12-12 16:03:07

For all people, complaining, this is a simple but beautiful problem. It's a pretty simple one, but I love its requirement for one to think and figure out the simple way!

Last edit: 2015-12-12 16:06:27
priyanshukm_17: 2015-12-11 12:48:34

Thank u @Abishek yr suggestion for fast io worked

gibibyte: 2015-11-22 18:44:32

use scanf to read values in c++

sumit suthar: 2015-11-11 16:02:51

Just XOR... :)

dk619: 2015-10-28 23:07:32

If using Sort method use Scanf instead of CIN.

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

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

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 !

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