The long-range laser at the board of combat spaceship “Rickenbacker” had
successfully destroyed all the launching pads on the surface of enemy
planet Orkut. Within less than a day, race Shodan had surrendered.
The captain of “Rickenbacker” expected a promotion. His enviers, in their
turn, were trying to persuade the high command that the captain was
a liar—no one is able to be so quick on the uptake and to strike so many
targets during an attack at the orbit. The captain understood that he was
to defend his honour and prepare a detailed report on the mission
accomplished. For a start, he decided to draw all the destroyed pads on
The laser direction system is bound to a rectangular Cartesian
coordinates. All the coordinates of the destroyed pads in these
coordinates are integers. Axes should be depicted with
symbols “|” (vertical slash, to show the y-axis), “-” (minus, to
show the x-axis), “+” (plus, to show the origin).
Spots where the destroyed pads were situated should be depicted
with symbol “*” (asterisk). All the other points should be depicted with
symbol “.” (dot). The x-axis in the graph should be directed to the
right, and the y-axis should be directed upwards. One
symbol in the graph corresponds to one unit on the x-axis
horizontally and to one unit on the y-axis vertically. The axes
should be depicted in the graph, but they may be completely covered with symbols “*”.
The first line contains an integer n (1 ≤ n ≤ 250) that is the
number of destroyed launching pads. Each of the following n lines contains
coordinates of one pad. All the coordinates are integers not exceeding
100 by absolute value. No two pads are situated at the same point.
Output the required graph. The first line should correspond to the maximum
value of y (or 0), and the last one should correspond to the minimum value
of y (or 0). Each line should have the same amount of symbols. The first
symbol in the line should correspond to the minimum value of x (or 0) and
the last one should correspond to the maximum value of x (or 0).
Problem Author: Andrey Demidov
Problem Source: Open Ural FU Personal Contest 2012