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 C (GCC 5.4.1) (judge verdict: Runtime Error)

#include <stdio.h>
#include <math.h>

int maxw = 1000000000;
int sosuu[100000];
int o(int a);
int main(void)
{
	long int S;
	scanf("%ld",&S);
	//printf("S = %ld\n",S);
	int x[3],y[3];
	x[0] = y[0] = x[1] = y[1] = x[2] = y[2] = 0;
	int i = 0;
	int koko = o(i);
	if(S <= maxw)
	{
		x[1] = 1;
		y[2] = S;
		printf("%d %d %d %d %d %d",x[0],y[0],x[1],y[1],x[2],y[2]);
		return 0;
	}
	//printf("1\n");
	i = 1;
	int count = 0;
	while(i <= sqrt(S) && count <= koko)
	{
		i = sosuu[count];
		//printf("i =  %d\n",i);
		if(S % i == 0 && S/i <= maxw)
		{
			x[1] = i;
			y[2] = S/i;
			printf("%d %d %d %d %d %d",x[0],y[0],x[1],y[1],x[2],y[2]);
			return 0;
			
		}
		count++;
	}
	//printf("2\n");
	return 0;
}
int o(int a)
{
	int i,j,flag;
	int count = 0;
	for(i=2; i <300000; i++)
	{
		flag = 0;
		for(j =2;j <=sqrt(i);j++)
		{
			if(i % j == 0){
				flag = 1;
				break;
			}
		}
		if(flag == 0){
			sosuu[count] = i;
			count++;
		}
	}
	return count;
}