Forest Fire
The "Great Oaks" Reserve is represented as a convex polygon on a plane, with the entire area covered by forest. Unfortunately, due to drought, forest fires have ignited in several locations. The fires are so intense that they cannot be controlled with the available local resources. As a result, it has been decided to evacuate rare species of local animals by helicopter. To maximize the time available for evacuation, the helicopter's landing point should be chosen such that the fire reaches it as late as possible.
Input
The first line of the input contains the number of vertices of the polygon, n (3 ≤ n ≤ 200). The next n lines each contain two integers, x_i and y_i, representing the x and y coordinates of the polygon's vertices, listed in traversal order. The (n+2)-th line contains the number of fire sources, k (1 ≤ k ≤ 200). The following k lines each provide two integers, the coordinates of the fire sources, x_j and y_j. All coordinates are integers with absolute values not exceeding 1000.
Output
Output the coordinates of a point within or on the boundary of the forest where the fire will arrive last. If there are multiple optimal solutions, any of them may be output. Ensure the coordinates are given with at least four decimal places of precision.