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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>

using namespace std;

/* char prime[100000]; */

long gcd(long x, long y) {
    if (x < y) return gcd(y, x);
    if (y == 0) return x;
    return gcd(y, x % y);
}

int main(void) {
    /* memset(prime, 1, sizeof prime); */
    /* for(int i=2; i<100000; i++) { */
    /*     if(!prime[i]) continue; */
    /*     for(int j=2; i*j<100000; j++) */
    /*         prime[i*j] = 0; */
    /* } */

    long s;
    cin >> s;
    for(long k=0; k<100; k++) {
        long t = sqrt(s)+k;
        long tt = t*t;

        long x, y;
        for(long i=1; i<10000000 && i<t; i++) {
            long j = (tt - s) / i;
            if (i < t && j < t)
                if (tt - i*j == s) {
                    x = i, y = j;
                    cout << 0 << ' ' << 0 << ' ' << t << ' ' << y << ' ' << x << ' ' << t << endl;
                    return 0;
                }
        }
    }
}