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.
Onotole has found not optimal AC algorithms, so all solutions will be rejudged. He is watching you.
In case you are doing this question using a sort, please use fast I/O
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:
For JAVA user's "chully bhar pani mein doob maro" => It's not your cup of tea
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.