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: Accepted)

#include <bits/stdc++.h>
using namespace std;
const int lim = 1e18;
typedef long long ll;
ll x2, y2, x3, y3;
ll s;
ll un,a,b;
int k;
//1000000000000000000
ll powerMod(ll n, ll b) {
	ll res = 1;
	while (b) {
		if (b & 1) res = res * n;
		n = n * n;
		b >>= 1;
	}
	return res;
}

int main() {
	ll s;
	cin >> s;
	if (s >= 1000000000000000000) {
		printf("0 0 1000000000 0 0 1000000000\n");
		return 0;
	}
	if (s <= 1000000000) {
		printf("0 0 1 0 0 %lld\n", s);
		return 0;
	}
	un = 1000000000;
	a = s/un;
	b = s % un;
	b = un - b;
	x3 = a+1;
	y2 = un;
	x2 = 1;
	y3 = b;
	printf("0 0 %lld %lld %lld %lld\n", x2, y2, x3, y3);
}