## LIFTS - Lifts

no tags

Serj likes old games very much. Recently he has found one arcade game in his computer. When controlling the hero it is necessary to move on a map and collect various items. At a certain stage of the game Serj has faced an unexpected problem. To continue his adventures the hero should get past over a chasm. For this purpose it is possible to use consistently located lifts which look like horizontal platforms. Each lift moves up-down vertically between some levels. The hero can pass between the next adjacent platform, however it can be done only at the moment when they are at the same level. Similarly, passing from the edge of a chasm onto the lift and vice versa is only possible at the moment when the lift appears on the level of the edge.

Each lift has a width equal to 4 meters. At the beginning the hero is in at a distance of two meters from the edge of a chasm. He should finish travel two meters after the opposite edge of the chasm. The hero moves at a speed of 2 meters a second. Thus, if the hero is in the initial position or in the center of the lift and wishes to pass to the next lift (or to descend from last lift onto the opposite edge of a chasm), he should begin movement exactly one second before they meet at one level. In two seconds the hero appears in the center of the next lift (or in the final position on the other side).

The edges of the chasm are at the same level. For each lift the range of heights between which it moves, its initial position and the direction of movement at the initial moment are given. All lifts move with a speed of one meter a second. Find out whether the hero can get over to the opposite edge of the chasm, and if so what the minimal time required for this purpose is.

### Input

t – the number of test cases, then t test cases follows.
[empty line]
A test case begins with n - the number of lifts, a positive integer (n <= 100), then n lines follow. The i-th line (0 < i <= n) contains four integers li ui si di, where: li - lowest position of the lift, ui - highest position of the lift, si - initial position of the lift, di - initial direction of movement (1 means up, -1 means down); (-100 <= li <= si <= ui <= 100, l1 < ui).

### Output

For each test case output the minmal time in seconds, required to get to the opposite edge of the chasm. If it is impossible output -1.

### Example

```Input:
1

4
-1 2 1 -1
0 3 0 1
-4 0 0 -1
-2 1 0 -1
```
```Output:
29
```

 Added by: Roman Sol Date: 2005-01-17 Time limit: 3s Source limit: 10000B Memory limit: 1536MB Cluster: Cube (Intel G860) Languages: All Resource: 5th Russian National Command Olympiad for schoolboys in programming