#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll X[3],Y[3];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	double PI=atan(1)*4;
	for(X[0]=400000000;X[0]<=500000000;X[0]++) {
		for(Y[0]=X[0]*tan(PI/12)-1;Y[0]<=X[0]*tan(PI/12)+1;Y[0]++) {
			if(abs(X[0]*X[0]+Y[0]*Y[0]-2*(X[0]-Y[0])*(X[0]-Y[0]))==1) {
				X[1]=X[0],Y[1]=Y[0];
			}
		}
	}
	cout<<"0 0"<<endl;
	cout<<X[1]<<" "<<Y[1]<<endl;
	cout<<Y[1]<<" "<<X[1]<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}