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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

void LinearSieve(ll n, vector<ll> &lpf, vector<ll> &prime){
	lpf.resize(n + 1);
	for(ll i = 2; i <= n; i ++){
		if(!lpf[i]){
			lpf[i] = i;
			prime.push_back(i);
		}
		for(ll j = 0; j < prime.size() && prime[j] <= lpf[i] && i * prime[j] <= n; j ++){
			lpf[i * prime[j]] = prime[j];
		}
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	ll s;
	cin >> s;
	if(s <= (ll)1e9){
		cout << "1 0 0 0 0 " << s;
		return 0;
	}
	vector<ll> lpf, prime;
	LinearSieve(100000, lpf, prime);
	int index = 0;
	for(ll a = ll(sqrt(s)) - 1, b = a + 1; index < 100000 ; a -= index + prime[index], b -= index + prime[index], index ++){
		ll ca = 0, cb = 0;
		ll z = a * b + s;
		ll k = z / b + 1;
		ll y = k * b - z, x = z - k * a;
		if(x <= 1e9 && y <= 1e9){
			cout << a << " " << 0 << "\n";
			cout << 0 << " " << b << "\n";
			cout << x << " " << y << "\n";
			break;
		}
	}
	return 0;
}