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
|
Scarface:
2015-01-31 22:22:53
Image isn't visible.
|
|
Devashish Mathur:
2015-01-27 15:16:45
Great Problem... Learnt something new... |
|
agaurav77:
2014-12-28 13:46:36
Cool question, giving a hint would spoil it. But believe me, doing this one is worth it. |
|
Madhur Bhargava:
2014-10-14 05:31:03
Java Guys: Fastest input handling will be required for this! |
|
numerix:
2013-04-15 16:07:15
I don't know what the problemsetter considers to be a "not optimal algorithm", but anyway it isn't fair to reduce timelimit after several AC submissions (e.g. my Python solution). Decision about timelimit should be made BEFORE a problemset is published. |
| Added by: | Efim |
| Date: | 2010-11-04 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
RSS