You found a map of a weirdly shaped labyrinth. The map is a grid, consisting of nn rows and nn columns. The rows of the grid are numbered from 11 to nn from bottom to top. The columns of the grid are numbered from 11 to nn from left to right.

The labyrinth has nn layers. The first layer is the bottom left corner (cell (1,1)(1,1)). The second layer consists of all cells that are in the grid and adjacent to the first layer by a side or a corner. The third layer consists of all cells that are in the grid and adjacent to the second layer by a side or a corner. And so on.

The labyrinth with 55 layers, for example, is shaped as follows:

The layers are separated from one another with walls. However, there are doors in these walls.

Each layer (except for layer nn) has exactly two doors to the next layer. One door is placed on the top wall of the layer and another door is placed on the right wall of the layer. For each layer from 11 to n1n−1 you are given positions of these two doors. The doors can be passed in both directions: either from layer ii to layer i+1i+1 or from layer i+1i+1 to layer ii.

If you are standing in some cell, you can move to an adjacent by a side cell if a wall doesn’t block your move (e.g. you can’t move to a cell in another layer if there is no door between the cells).

Now you have mm queries of sort: what’s the minimum number of moves one has to make to go from cell (x1,y1)(x1,y1) to cell (x2,y2)(x2,y2).

Input

The first line contains a single integer nn (2n1052≤n≤105) — the number of layers in the labyrinth.

The ii-th of the next n1n−1 lines contains four integers d1,x,d1,y,d2,xd1,x,d1,y,d2,x and d2,yd2,y (1d1,x,d1,y,d2,x,d2,yn1≤d1,x,d1,y,d2,x,d2,y≤n) — the coordinates of the doors. Both cells are on the ii-th layer. The first cell is adjacent to the top wall of the ii-th layer by a side — that side is where the door is. The second cell is adjacent to the right wall of the ii-th layer by a side — that side is where the door is.

The next line contains a single integer mm (1m21051≤m≤2⋅105) — the number of queries.

The jj-th of the next mm lines contains four integers x1,y1,x2x1,y1,x2 and y2y2 (1x1,y1,x2,y2n1≤x1,y1,x2,y2≤n) — the coordinates of the cells in the jj-th query.

Output

For each query, print a single integer — the minimum number of moves one has to make to go from cell (x1,y1)(x1,y1) to cell (x2,y2)(x2,y2).

Examples
input

Copy
2
1 1 1 1
10
1 1 1 1
1 1 1 2
1 1 2 1
1 1 2 2
1 2 1 2
1 2 2 1
1 2 2 2
2 1 2 1
2 1 2 2
2 2 2 2

output

Copy
0
1
1
2
0
2
1
0
1
0

input

Copy
4
1 1 1 1
2 1 2 2
3 2 1 3
5
2 4 4 3
4 4 3 3
1 2 3 3
2 2 4 4
1 4 2 3

output

Copy
3
4
3
6
2

Note

Here is the map of the labyrinth from the second example. The doors are marked red.