Minimum Meeting Time

Sam and Alex are located at two different points on a grid, given by the coordinates \((x_1, y_1)\) and \((x_2, y_2)\). They can only meet by moving along the grid lines. The minimum time required for them to meet is determined by the Manhattan distance between their locations, which is given by the formula \( |x_2 - x_1| + |y_2 - y_1| \). Your task is to calculate this minimum time for each test case provided.

inputFormat

The input is given via standard input. The first line contains an integer \(T\) which denotes the number of test cases. Each of the following \(T\) lines contains four space-separated integers \(x_1\), \(y_1\), \(x_2\), \(y_2\) representing the coordinates of Sam and Alex respectively.

outputFormat

For each test case, output a single line containing the minimum time for Sam and Alex to meet, computed as \( |x_2 - x_1| + |y_2 - y_1| \).

1
2 3 5 3

3