#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


int main(){
    ll x;cin >> x;
    ll n=100000;
    assert(n<x);
    ll m=(x+n-1)/n;
    ll p=((n-x)%n+n)%n;
    ll k=x+1;
    if(p==0){
        vl mle(INF);
    }
    else{
        vl a(n,1);
        rep(i,n-p)a[i]=k;
        ll f=x-(p-1);
        a.back()=f;
        vl b(m,k);
        b.back()=1;
        cout << n << " " << m <<" " << k << endl;
        cout << "*" <<" ";
        rep(i,m){
            if(i)cout << " ";
            cout << b[i];
        }cout << endl;
        rep(i,n)cout << a[i] << endl;
    }
}