H. The Hard One
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Pacha wanted to propose a super hard problem so that Nico could not solve it, but Pacha ran out of time, so now you have this problem titled The Hard One.

Pacha gives you two even integers $$$a$$$ and $$$b$$$, and assures you that there exists a number $$$x$$$ satisfying a very particular condition: the distance between $$$x$$$ and $$$a$$$ is exactly the same as the distance between $$$x$$$ and $$$b$$$.

Formally: $$$|x - a| = |x - b|$$$.

Pacha wants to find that number $$$x$$$. It is guaranteed that the answer is a unique integer and that it always exists.

Input

The first line contains an integer $$$t$$$ ($$$1 \le t \le 10^3$$$), the number of test cases.

Each of the next $$$t$$$ lines contains two integers $$$a$$$ and $$$b$$$ ($$$-10^3 \le a, b \le 10^3$$$, $$$a \ne b$$$).

Output

For each test case, print a single number $$$x$$$ such that $$$|x - a| = |x - b|$$$.

Example
Input
3
-2 2
0 2
10 20
Output
0
1
15