#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
struct mll {
	static ll MOD;
	ll val;
	mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; }
	mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; }
	mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c = b.val, d = MOD, u = 1, v = 0;
		while (d) {
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b) {
		chmin(b, a - b);
		if (b < 0) return mll(0);
		mll c = 1;
		rep(i, b) c *= a - i;
		rep(i, b) c /= i + 1;
		return c;
	}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

int main() {
	ll S;
	cin >> S;

	ll Y3 = (S / 1000000000) + 1;
	ll Y2 = 1000000000 - (S % 1000000000);

	if (Y2 == 1000000000) {
		Y3--;
		Y2 = 0;
	}

	cout << "0 0 1000000000 " << Y2 << " 1 " << Y3 << endl;

	eprintf("debug: %lld\n", 1000000000 * Y3 - Y2);

	return 0;
}


//TLE
/*
class LLPair
{
public:
	LLPair() {}
	LLPair(bool valid, LL a, LL b) : valid(valid), a(a), b(b) {}
public:
	LL a = 0;
	LL b = 0;
	bool valid = false;
	bool calc = false;
};

std::map<LL, LLPair> mp;

bool split(LL X, LL &a, LL &b) {
	LLPair pair = mp[X];
	if (pair.calc == true) {
		if (pair.valid) {
			a = pair.a;
			b = pair.b;
		}
		return pair.valid;
	}

	if (X % 2 == 0 && X <= 2000000000) {
		a = 2;
		b = X >> 1;
		mp[X].valid = true;
		mp[X].calc = true;
		mp[X].a = a;
		mp[X].b = b;
		return true;
	}

	LL root = (LL)sqrt((double)X);
	for (LL i = max(1LL, X / 1000000000); i <= root; i += 2) {
		if (X % i == 0) {
			a = i;
			b = X / a;
			if (b > 1e9) {
				continue;
			}
			mp[X].valid = true;
			mp[X].calc = true;
			mp[X].a = a;
			mp[X].b = b;
			return true;
		}
	}

	mp[X].valid = false;
	mp[X].calc = true;

	return false;
}

int main()
{
	LL S;

	cin >> S;

	LL X1 = 0, Y1 = 0, X2 = 0, Y2 = 0;
	LL A, B;

	for (A = S; A <= 1e18; A++) {
		B = A - S;
		if (split(B, X2, Y1)) {
			if (split(A, X1, Y2)) {
				break;
			}
		}
	}

	printf("%lld %lld %lld %lld 0 0\n", X1, Y1, X2, Y2);

	//printf("%lld\n", X1 * Y2 - X2 * Y1);
}
*/

Measured memory_bytes: 256