Keep in Touch

Two agents, A and B, are known as a great combination. They are carrying out an infiltration mission to a secret base. Because the base has strict security, the two agents have decided to follow the prechecked safe infiltration routes $R_A$ and $R_B$, respectively. Each route is a two-dimensional polyline, a series of line segments.

Each agent starts at the starting end of the first segment of its route. The mission is over when both agents are on the finishing ends of the last segments of their routes at the same time.

During the mission, each agent can move forward or backward at any speed, or stop for a moment, as long as its movement along the route is continuous. An agent cannot jump to a new position. Segments may cross or overlap, but they cannot be used for movement. Precisely, an agent on one segment can move to another segment only in these cases.

• The destination is the next segment on the route, and the agent is at the finishing end of the current segment.
• The destination is the previous segment on the route, and the agent is at the starting end of the current segment.

For example, in Figure G-1, the agent must reach the finishing end of segment 3-4 of $R_B$, which is $(-1, 1)$, before it can move to segment 4-5. When the agent moves from segment 2-3 to segment 3-4, it passes $(2, 1)$, the finishing end of the last segment. That passage does not count, because the agent is not considered to be at the finishing end of the last segment at that time.

Figure G-1: Infiltration routes for the first dataset

Figure G-2: Infiltration routes for the second dataset

The two agents must always stay within communication range of each other. A stronger signal allows a longer communication distance, but it also raises the chance of interception. Find the minimum communication distance that lets the agents complete the mission with suitable movements.

The input consists of multiple datasets, each in the following format.

n
xA,1 yA,1
 ⋮
xA,n yA,n
m
xB,1 yB,1
 ⋮
xB,m yB,m

$n$ is the number of vertices of route $R_A$. $n$ is an integer from 2 to 40, inclusive.

$x_{A,i}$ and $y_{A,i}$ ($1 \le i \le n$) are the coordinates of the $i$-th vertex. They are integers satisfying $-1000 \le x_{A,i} \le 1000$ and $-1000 \le y_{A,i} \le 1000$. For $1 \le i \le n-1$, $(x_{A,i}, y_{A,i})$ is the starting end of the $i$-th segment, and $(x_{A,i+1}, y_{A,i+1})$ is its finishing end. Every segment has nonzero length, so $x_{A,i} \ne x_{A,i+1}$ or $y_{A,i} \ne y_{A,i+1}$ holds.

$m$ and the pairs $x_{B,j}$ and $y_{B,j}$ ($1 \le j \le m$) describe route $R_B$. The format and constraints are the same as for $R_A$.

The input ends with a line containing 0.

For each dataset, print on one line the maximum distance between the two agents during the mission, when the agents move so that this maximum is as small as possible. The error must not exceed $10^{-8}$. An answer is accepted if either its relative error or its absolute error is within this limit.