github.com/captn3m0/codechef.git

---
category_name: school
problem_code: MISSP
problem_name: 'Chef and Dolls'
languages_supported:
    - ADA
    - ASM
    - BASH
    - BF
    - C
    - 'C99 strict'
    - CAML
    - CLOJ
    - CLPS
    - 'CPP 4.3.2'
    - 'CPP 4.9.2'
    - CPP14
    - CS2
    - D
    - ERL
    - FORT
    - FS
    - GO
    - HASK
    - ICK
    - ICON
    - JAVA
    - JS
    - 'LISP clisp'
    - 'LISP sbcl'
    - LUA
    - NEM
    - NICE
    - NODEJS
    - 'PAS fpc'
    - 'PAS gpc'
    - PERL
    - PERL6
    - PHP
    - PIKE
    - PRLG
    - PYPY
    - PYTH
    - 'PYTH 3.4'
    - RUBY
    - SCALA
    - 'SCM chicken'
    - 'SCM guile'
    - 'SCM qobi'
    - ST
    - TCL
    - TEXT
    - WSPC
max_timelimit: '1'
source_sizelimit: '50000'
problem_author: karthikv1392
problem_tester: null
date_added: 30-04-2015
tags:
    - karthikv1392
time:
    view_start_date: 1436519986
    submit_start_date: 1436519986
    visible_start_date: 1436519986
    end_date: 1735669800
    current: 1492506782
layout: problem
---
All submissions for this problem are available.Chef is fan of pairs and he likes all things that come in pairs. He even has a doll collection in which all dolls have paired.One day while going through his collection he found that there are odd number of dolls. Someone had stolen a doll!!!

Help chef find which type of doll is missing..

### Input

The first line contains the number of test cases. 
Second line of the input contains the number of elements in the array. 
The next n lines are the types of each doll that is left.

### Output

Find the type of doll that doesn't have a pair

### Constraints

1<=T<=10 
1<=N<=100000 (10^5) 
1<=ti<=100000

<pre><b>Input:</b>
1
3
1 
2
1
<br></br>
<b>Output:</b>
2
</pre><pre><b>Input:</b>
1
5
1
1
2
2
3
<b>Output:</b>
3
</pre>