#include <bits/stdc++.h>
using namespace std;

int64_t extgcd(int64_t a, int64_t b, int64_t& x, int64_t& y){
    int64_t d = a;
    if(b != 0){
        d = extgcd(b, a%b, y, x);
        y -= (a/b) * x;
    }else{
        x = 1; y = 0;
    }
    return d;
}

int64_t inv_mod(int64_t a, int64_t MOD){
    int64_t x, y;
    extgcd(a, MOD, x, y);
    return (MOD + x%MOD) % MOD;
}

int64_t gcd(int64_t a, int64_t b){
    return b==0 ? a : gcd(b, a%b);
}

int main(){
    int64_t X;
    cin >> X;
    if(X == 0){
        cout << "2 1 2" << endl;
        cout << "* 1" << endl;
        cout << "1\n1\n";
        return 0;
    }
    int64_t N = 1e5;
    int64_t Q = X/N, R = X%N;
    int64_t K = 1e9;
    for(int t=1; ; t++){
        if(gcd(K, 2+t) > 1) continue;
        int64_t v = (K/2*t%K*R + (2+t)*(N-R-1)) % K;
        v = (X-v+K) % K;
        if(v == 0) continue;
        int64_t x = inv_mod(2+t, K) * v % K;
        if(x < K/2){
            int M = Q + 1 + t;
            vector<int> A, B;
            for(int i=0; i<R; i++) A.push_back(K/2);
            A.push_back(x);
            while(A.size() < N) A.push_back(1);
            for(int i=0; i<Q; i++) B.push_back(K);
            B.push_back(2);
            while(B.size() < M) B.push_back(1);

            cout << N << " " << M << " " << K << endl;
            cout << "*";
            for(int b : B) cout << " " << b;
            cout << endl;
            for(int a : A) cout << a << endl;
            return 0;
        }
    }
    return 0;
}