시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 512 MB 0 0 0 0.000%

문제

A new racing track is being constructed for Flatland Grand Prix Formula 42 race. Well known track architect Herman Kilkin was invited, and he has prepared the track plan. However, when the construction began it turned out that there is a problem with the project.

Formula 42 racing track is an area delimited by two borders. Each border is a closed polyline that is a boundary of a convex polygon. The inner border is completely inside the outer border and has no common points with it. The racing car in Formula 42 is a circle. There are no limits for its radius, so the larger is the circle, the more spectacular the race is.

The problem with the track project is that Herman has only designed the outer border and the inner border separately. Their relative position is not specified. Now the company that is constructing the track can choose any relative position of the borders. They want to place them in such way that the race was most spectacular. However, they can only make parallel translations of the borders, but cannot rotate, flip or modify them in any other way.

It is required to find such relative position of the borders, that the resulting track can be used for the race with the maximal possible size of the racing car. The track can be used by a racing car of radius $r$, if the car of such radius can drive a complete lap around the inner border while staying at track. It is allowed to touch the borders. Formally, for a point $P$ inside the inner border there must be such continuous closed polyline, such that $P$ is inside this polyline, and for any point on the polyline a circle of radius $r$ with its center in this point is inside the outer border and outside of the inner border, touching is allowed. 

Help the construction company to deal with Herman's plan, and find out for what maximal radius of the racing car they can construct a racing track with the given design of its inner and outer borders.

입력

Input contains descriptions of two convex polygons, their boundaries give the shape of the outer and the inner borders, respectively.

The first line contains $n$ --- the number of vertices of the first polygon ($3 \le n \le 100$). The following $n$ lines contain two integers $x_i$ and $y_i$ each --- coordinates of the vertices of the first polygon ($0 \le x_i, y_i \le 1\,000$). 

The next line contains an integer $m$ --- the number of vertices of the second polygon ($3 \le m \le 100$). The following $m$ lines contain two integers $x'_i$ and $y'_i$ each --- coordinates of the vertices of the second polygon ($0 \le x'_i, y'_i \le 1\,000$). 

Vertices of each polygon are given in counterclockwise order. Polygons are convex, no three points of one polygon are on the same line. It is guaranteed that the polygons can be translated in such way that the second one is completely inside the first one, and their boundaries have no common points.

출력

Output one real number --- the maximal possible radius of the racing car. The answer must be correct with absolute or relative error not exceeding $10^{-6}$.

예제 입력 1

4
0 0
3 0
3 3
0 3
4
0 0
1 0
1 1
0 1

예제 출력 1

0.5

예제 입력 2

4
0 0
3 0
3 3
0 3
3
0 0
2 1
1 2

예제 출력 2

0.25

힌트