You are in a new city C where all the streets in this city cross each other at different points.

Your goal is to find out the length of the shortest path to walk from building A to building B $($in

miles$).$ The city has the following layout:

$$ Street S $=[$index$,$ layout, is one way, length$]$

$$ Index: an integer from $0$ to $($N $1)$ that represents the index of the street in the city$$s

layout. Note that two different streets $($with vertical and horizontal layout$)$ may have

the same street$$s index.

$$ Layout: an integer value represented by $(0$ or $1)$ defining the layout of the street in

relation to other streets in the city.

$$ Value $0$: vertical street

$$ Value $1$: horizontal street

$$ Is one way: an integer value represented by $(0$ or $1)$ that defines whether the street is

one$-$way or not

$$ Value $0$: False

$$ Value $1$: True

$$ Length: an decimal value that represents the length of the street in miles from the

starting point to the end point of the street.

$$ Building X $=[$street$,$ position, location$]$

$$ Street: a street S representing the street where the building is located

$$ Position: an interger value represented by $(0$ or $1)$:

$$ Value $0$: right side of the street

$$ Value $1$: left side of the street

$$ Location: An interger value represented by $(0,1,2)$:

$$ Value $0$: the building is located at the start of the street

$$ Value $1$: the building is located at the middle of the street

$$ Value $2$: the building is located at the end of the stree