There is a n × 1 board. Its cells are numbered with integers from 1 to n. First four cells have indistinguishable chips in them. In one turn you can move one chip to the neighbouring cell or move it symmetrically relatively any other chip (i.e. if you move a chip in cell 10 symmetrically relative to the chip in cell 13 it will end up in cell 16), given that the chip won't leave the board and each cell will have no more than one chip. You need to determine the minimum number of turns needed to reach a certain configuration of chips.

Input

The first line of input contains number T - the amount of test cases. Next T lines consist of four integers a₁, a₂, a₃ and a₄ — the numbers of cells where the chips should be in the final configuration.

Constraints

1 <= T <= 10000
1 <= a₁ < a₂ < a₃ < a₄ <= n
n = 70

Output

For each test case print single integer - the answer to the problem in the statement.

Example

Input:
2
1 2 3 4
1 3 4 6

Output:
0
1