Android Vasya prepares a research work in Biology.
In this work he studies the class of arachnoid. Vasya is not interested in spiders themselves,
his work is mostly concentrated on the webs made by different species of spiders.
Vasya has already found out how the web is made.
It is a set of points — the web knots, connected with each other by the socalled fibres.
One may imagine the web knots as coplanar points.
The web fibres are line segments, connecting the knots.
An important property of these segments is that they cross only in the knots.
Vasya wants to determine which spiders make webs with the highest quality.
For this purpose he defined the stickiness of the web as amount of different traps in it.
A trap is a polygon with no selfcrossings and selftagencies, where knots of the web are vertexes and fibres are edges.
Vasya has analysed several webs with 16 knots.
As a result, he has discovered that stickiness of those webs is between 5 000 and 300 000.
And now he is interested in finding out how a web with 16 knots and stickiness more than 300 000 can look like.
Input
There is no input data in this task.
Output
In the first 16 lines output coordinates of the web knots as pairs of integers x_{i}, y_{i} (−1000 ≤ x_{i}, y_{i} ≤ 1000).
In the next 16 lines output an adjacency matrix of the web — the table of a size 16 × 16, composed of the symbols “0” and “1”.
The matrix should be symmetrical and its main diagonal should be filled with zeros.
Any two knots of the web should lie in different points. Knots mustn’t lie on the inner points of the fibres.
Any two fibres may cross only in their common knot.
The web should have stickiness more than 300 000. It is guaranteed that such webs exist.
Sample
input  output 

 0 0
5 6
5 6
9 3
0 8
9 3
011111
101001
110100
101010
100101
110010

Notes
The answer in the example is not correct and just illustrates the answer format.
Note, that you should output the web with 16, not 6, knots.
The picture above corresponds to this example.
The stickiness of the web in the example is only 21.
Problem Author: Alexander Ipatov
Problem Source: Ural Sport Programming Championship 2015