Problem:
Score : 400 points

Problem Statement

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:

0 \leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \leq 10^9

The area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.

We can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.

Constraints

1 \leq S \leq 10^{18}

All values in input are integers.

Input

Input is given from Standard Input in the following format:

S

Output

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.

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 (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.

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

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;

public class Main {
	public static void main(String args[]) {
		Scanner scn = new Scanner(System.in);
		long S = scn.nextLong();
		long X1, X2=-1, X3, Y1, Y2, Y3=-1;
		X1 = 0;
		Y1 = 0;

		if (S == 1000000000000000000L) {
			X2 = 0;
			Y3 = 0;
			Y2 = 1000000000L;
			X3 = 1000000000L;
		} else {
			long T = (long) Math.sqrt(S) + 1;
			Y2 = T;
			X3 = T;

			long SS = Y2 * X3 - S;

			for(long i = 1;i <= Math.sqrt(SS);i++) {
				if(SS%i==0) {
					X2 = i;
					Y3 = SS/i;
					if((X2 <= 1000000000L) && (Y3 <= 1000000000L))break;
				}
			}

		}
			System.out.println(X1 + " " + Y1 + " " + X2 + " " + Y2 + " " + X3 + " " + Y3);
	}
}