hdu1563 Find your present!

#include <stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int main(){
	int x[205],i,n;
	while(scanf("%d",&n) , n){
		memset(x,-1,sizeof(x));
		for(i=1;i<=n;i++)
			scanf("%d",&x[i]);
		sort(x+1,x+n+1);
		for(i=1;i<=n;i++)
			if(x[i]!=x[i-1] && x[i]!=x[i+1]){
				printf("%d\n",x[i]);
				break;
			}
	}
    return 0;
}