3069: Seek Spy

时间限制:1000 ms 内存限制:128 MB
上传者:
提交:39 通过:15

题目描述

In order to celebrate the admission of new members, Coach Fang resolves to hold a programme named $Who \ is \ the \ spy$. Participants include Coach Fang, Boss Niu, God Chai, Brother Wang, Teacher Gao and Senior Wang, six persons in total. Initially all of them will be distributed one card which contains a number. It is known that five of the numbers on their cards are identical, and the rest one is different.

Now give you six numbers on the cards, please print the different one.

输入格式

The first line contains an integer number T, the number of test cases.

$i^{th}$ of each next T lines contains six integers $a$, $b$, $c$, $d$, $e$, $f$($1 \leq a, b, c, d, e, f \leq 100$).

输出格式

For each test case print a number, the number which differs from others.

输入样例 复制

2
3 4 3 3 3 3
6 6 6 5 6 6

输出样例 复制

4
5