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# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;

public class Hello{
    public static void Main(){
        long S=long.Parse(Console.ReadLine());
        double a=Math.Pow((double)S,0.5)+1;
        double b=a-a%1;
        double c=Math.Pow(b,2)-(double)S;
        string ans;
        if(c<=1000000000){
            ans="0 0 "+((long)b).ToString()+" "+((long)c).ToString()+" 1 "+((long)b).ToString();
        }else{
            ans="0 1 "+((long)b-1).ToString()+" 0"+((long)c).ToString()+" "+((long)((double)S-Math.Pow(b-1,2))).ToString()+" "+((long)b).ToString();
        }
        Console.WriteLine(ans);
    }
}