Hack

#include <bits/stdc++.h>
using namespace std;
#define _rep(i_,a_,b_) for(int i_ = (a_); i_ <= (b_); ++i_)
#define mid ((L+R) >> 1)
#define multiCase() int testCnt = in(); _rep(curCase,1,testCnt)
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
using ll = long long;
using pii = pair<int,int>;
using ull = unsigned long long;
const int inf = 0x3f3f3f3f;
const ll inf64 = 0x3f3f3f3f3f3f3f3fll;
int in(void) { int x; scanf("%d", &x); return x; } ll inl(void) { ll x; scanf("%lld", &x); return x; }
void out(int x) { printf("%d ", x); } void outln(int x) { printf("%d\n", x); }
template<typename T, typename U> void chkmax(T &a, const U &b) { if(b > a) a = b; } 
template<typename T, typename U> void chkmin(T &a, const U &b) { if(b < a) a = b; } 
mt19937 engine(chrono::system_clock::now().time_since_epoch().count());
int n = 1000000;

int main() { 
	out(n), outln(2);
	_rep(i,1,n / 5) out(1e9); 
	_rep(i,1,n / 5) out(-1e9); 
	_rep(i,1,n / 5) out(1e9); 
	_rep(i,1,n / 5) out(-1e9); 
	_rep(i,1,n / 5) out(1e9); 
	puts("");
	return 0;
}