Find your present（https://acs.jxnu.edu.cn/problem/HDU1563）

描述：

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.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.

输入：

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

输出：

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

翻译：在新的一年，每个人都获得一个特殊的礼物.现在你需要获得你的礼物，一些礼物放在桌子上，并且他们之中只有一个是你的.每个礼物上有一个号码，并且你的号码独一无二.举个例子，现有五个礼物并且他们的号码是1.2.3.2.1，所以标号为3的礼物是你的，因为3是其中只出现一次的数字.

输入：输入由一些测试样例组成，每个测试样例第一行输入一个整数n（1<=n<=200），接着下一行输入n个正整数，这些数字代表着礼物上的号码，并且当输入为0时停止输入.

输出：对于每一个测试样例。一行输出一个独特的整数，即你礼物上的号码.