Preparing NOJ

Find Your Present

1000ms 32768K

Description:

In the new year party, everybody will get a "special present".Now it's your turn to get your special present, a lot of presents now putting on the desk, and only one of them will be yours.Each present has a card number on it, and your present's card number will be the one that different from all the others, and you can assume that only one number appear odd times.For example, there are 5 present, and their card numbers are 1, 2, 3, 2, 1.so your present will be the one with the card number of 3, because 3 is the number that different from all the others.

Input:

The input file will consist of several cases.
Each case will be presented by an integer n (1<=n<1000000, and n is odd) at first. Following that, n positive integers will be given in a line, all integers will smaller than 2^31. These numbers indicate the card numbers of the presents.n = 0 ends the input.

Output:

For each case, output an integer in a line, which is the card number of your present.

Sample Input:

5
1 1 3 2 2
3
1 2 1
0

Sample Output:

3
2

Note:

use scanf to avoid Time Limit Exceeded

本题由旧版NOJ导入,来源:HDU OJ

Info

NOJ

Provider NOJ

Code NOJ1151

Tags

Submitted 19

Passed 4

AC Rate 21.05%

Date 04/20/2019 10:03:10

Related

Nothing Yet