Odd One Out

Odd One Out

Problem

You are given three digits a, b, c. Two of them are equal, but the third one is different from the other two.

Find the value that occurs exactly once.

Input

The first line contains a single integer t (1≤t≤270) — the number of test cases.

The only line of each test case contains three digits a, b, c (0≤a, b, c≤9). Two of the digits are equal, but the third one is different from the other two.

Output

For each test case, output the value that occurs exactly once.

Example

Input

10
1 2 2
4 3 4
5 5 6
7 8 8
9 0 9
3 6 3
2 8 2
5 7 7
7 7 5
5 7 5

Output

1
3
6
7
0
6
8
5
5
7

Code

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <sstream>//整型转字符串
// #include <stack>//栈
// #include <deque>//堆/优先队列
// #include <queue>//队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    ll t;
    cin>>t;

    while(t--)
    {
        ll a[3];
        cin>>a[0]>>a[1]>>a[2];

        sort(a,a+3);

        if(a[0]!=a[1]) cout<<a[0]<<endl;
        else cout<<a[2]<<endl;
    }
    
    return 0;
}