#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b){
	if(b==0) return a;
	return gcd(b, a%b);
}
ll inv(ll a, ll m){
    ll b=m, x=1, y=0;
    while(b>0){
        ll t=a/b;
        swap(a-=t*b, b);
        swap(x-=t*y, y);
    }
    return (x%m+m)%m;
}
int main()
{
	ll x; cin>>x;
	if(x==0){
		cout<<"3 2 129"<<endl;
		cout<<"+ 12 34"<<endl;
		cout<<10<<endl;
		cout<<20<<endl;
		cout<<30<<endl;
		return 0;
	}
	int n=50000, m;
	if(x%n==0) n++;
	ll k=1e9;
	ll b[100010], a[100010];
	a[0]=k;
	for(int i=0; i<x/n; i++) b[i]=k;
	int r=x%n;
	m=x/n+r;
	int r1=r;
	while(1){
		ll g=gcd(r1, k);
		if(x%g==0) break;
		r1++;
	}
	for(int i=0; i<r; i++){
		if(i<r1-r) b[i]=2;
		else b[i]=1;
	}
	ll g=gcd(r1, k);
	ll y=inv(r1/g, k/g)*(x/g)%(k/g);
	if(y<n-1) y+=k;
	for(int i=1; i<n; i++){
		a[i]=1+(y-(n-1))/(n-1);
		if(i-1<y%(n-1)) a[i]++;
	}
	cout<<n<<" "<<m<<" "<<k<<endl;
	cout<<"*";
	for(int i=0; i<m; i++) cout<<" "<<b[i];
	cout<<endl;
	for(int i=0; i<n; i++) cout<<a[i]<<endl;
	return 0;
}