ADV04F1  Four Chips (Hard)
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_{1}, a_{2}, a_{3} and a_{4} — the numbers of cells where the chips should be in the final configuration.
Constraints
1 <= T <= 10000
1 <= a_{1} < a_{2} < a_{3} < a_{4} <= 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
hide comments
ryazdi:
20211226 07:51:11
TL is too tight...


m_manas_s:
20210910 17:55:54
More cases, please? 

ankish_1234:
20210605 05:03:39
can anyone explain me this question ?


LeppyR64:
20110210 17:05:03
Is it allowed for two chips to occupy the same cell at any time during the processing?

Added by:  Spooky 
Date:  20101114 
Time limit:  3.289s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 