#agc036a. [agc036_a]Triangle
[agc036_a]Triangle
Problem Statement
Given is an integer . Find a combination of six integers and that satisfies all of the following conditions:
- The area of the triangle in a two-dimensional plane whose vertices are and is .
We can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.
Constraints
- All values in input are integers.
Input
Input is given from Standard Input in the following format:
Output
Print six integers and that satisfy the conditions, in this order, with spaces in between. If multiple solutions exist, any of them will be accepted.
Sample Input 1
3
Sample Output 1
1 0 2 2 0 1
The area of the triangle in a two-dimensional plane whose vertices are and is . Printing 3 0 3 1 0 1
or 1 0 0 1 2 2
will also be accepted.
Sample Input 2
100
Sample Output 2
0 0 10 0 0 10
Sample Input 3
311114770564041497
Sample Output 3
314159265 358979323 846264338 327950288 419716939 937510582