Finding a Constellation

Sanggeun is looking for a particular constellation in a photo of the night sky. The photo contains exactly one figure that has the same shape, orientation, and size as the constellation he wants to find. However, besides the stars that make up that constellation, the photo also contains other, unrelated stars.

If every star of the target constellation is translated by $dx$ along the x-axis and $dy$ along the y-axis, the result exactly matches the position of the constellation in the photo. (For example, the shift might be $2$ in the x-direction and $-3$ in the y-direction.)

Given the shape of the constellation you want to find and the positions of all stars in the photo, write a program that determines the translation $(dx, dy)$ needed to move the constellation's coordinates onto their positions in the photo. This translation is guaranteed to be unique.

The first line contains the number of stars $m$ that make up the constellation to find. Each of the next $m$ lines contains the x- and y-coordinates of one star of the constellation.

The next line contains the number of stars $n$ in the photo. Each of the next $n$ lines contains the x- and y-coordinates of one star in the photo.

• $1 \le m \le 200$
• $1 \le n \le 1000$
• All x- and y-coordinates are integers between $0$ and $1{,}000{,}000$, inclusive.

Print, on a single line, the translation that maps the constellation's coordinates onto the photo. The first integer is the shift $dx$ along the x-axis and the second integer is the shift $dy$ along the y-axis, separated by a space.