SPOJ.com - Problem OLOLO

OLOLO - Onotole needs your help

#ad-hoc-1

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.

Submit solution!

hide comments

< Previous 4 5 6 7 8 9 10 11 12 13 14 Next >

	Kishore H Patel: 2015-04-16 19:49:21 For JAVA user's "chully bhar pani mein doob maro" => It's not your cup of tea
	Prasanna Patil: 2015-04-14 04:04:39 Nice problem... Learnt something awesome.
	bholagabbar: 2015-04-13 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. As for JAVA, i tried picking up uwi's IO and implementing it in mine and running. Still TLE. If not uwi's IO then umm...you've got a major probelm. For those who don't know uwi: www.codechef.com/users/uwi Last edit: 2015-04-13 22:10:59
	arjun: 2015-04-13 17:28:20 Whatever language you use. Just perform faster io operations. Can be done in O(n) and O(nlogn) too.
	MD: 2015-04-02 21:53:39 great concept!! new thing to learn.. Last edit: 2015-04-02 21:54:31
	.:: Jarv1s ::.: 2015-03-15 19:06:30 Learned a new thing!
	Francky: 2015-02-03 19:08:28 The issue seems solved.
	Mitch Schwartz: 2015-02-01 14:58:34 I downloaded one of my previously uploaded images and it differed from the original by one byte: the one on SPOJ server has a 0x0A byte appended to the beginning. Francky → Nice catch! Independently, could you confirm that RSS is broken? (I've yet email admins for that too). (Mitch) I just thought about that before reading your reply. It looks like it's actually the same issue: an extra '\n' appearing at the beginning of the file. You can see all the RSS data is still there if you view source. And this '\n' is also present for problem description pages. I don't know if the original files have all been modified, or if they are just being generated on the fly with this extra byte. Francky → Nice combo catch!! Then it sounds not so independent ;-) Let's wait for admin's patch. There should have been some tests on their side ; I think your option 2 is the good one (on the fly). And all things should be cleared in the same time. Last edit: 2015-02-01 16:51:07

Submit solution!

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