HDoj-2095-与众不同

Problem Description

Input

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.

Output

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

Sample Input

Sample Output

3
2

#include<stdio.h>
int main()
{
    int T;
    int n,m;
    while(~scanf("%d",&T),T){
        scanf("%d",&n);
        
        while(--T){
            scanf("%d",&m);
            n=m^n;               
       }
        printf("%d
",n);
    }
    
    return 0;
}