Score : 400 points
Given is an integer S. Find a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:
We can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.
Input is given from Standard Input in the following format:
S
Print six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between. If multiple solutions exist, any of them will be accepted.
3
1 0 2 2 0 1
The area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.
Printing 3 0 3 1 0 1
or 1 0 0 1 2 2
will also be accepted.
100
0 0 10 0 0 10
311114770564041497
314159265 358979323 846264338 327950288 419716939 937510582