#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}


random_device seed_gen;
mt19937 rng(seed_gen());
long long rand_long(long long l,long long r){
    return uniform_int_distribution<long long>(l,r-1)(rng);
}


//最大公約数
long long Gcd(long long a,long long b){
    if(b==0) return a;
    else return Gcd(b,a%b);
}

//最小公倍数
long long Lcm(long long a,long long b){
    return (a/Gcd(a,b))*b;
}
//カーマイケル数の出力
long long carmichael(long long a){
    long long ans=1,A=1;
    //2を素因数に持つときだけ場合わけ
    while(a%2==0) A*=2,a/=2;
    if(A==4) ans=2;
    else if(A>4) ans=A/4;
    A=a;
    for(long long k=3;k*k<=a;k++){
        //for(auto k:div){ //配列divをsqrt(a)以下の素数を全列挙するやつにする
        if(A%k==0){
            long long B=k-1;
            A/=k;
            while(A%k==0) A/=k,B*=k;
            ans=Lcm(ans,B);
        }
    }
    if(A!=1) ans=Lcm(ans,A-1);
    return ans;
}


using LL = __int128_t;

ll my_pow(LL a, ll b, ll c){
    LL res = 1;
    while (b){
        if (b & 1) res = a * res % c;
        b /= 2;
        a = a * a % c;
    }
    return res;
}



void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N;
    cin >> N;
    ll M = N;
    while (M % 5 == 0) M /= 5;
    while (M % 2 == 0) M /= 2;
    ll C = carmichael(M);
    ll a = 0;
    while (true){
        // a += N / M;
        a = rand_long(1, 1'000'000) * (N / M);
        if (a % 10 == 0) continue;
        ll b = 0;
        {
            string tmp = to_string(a);
            while (!tmp.empty()){
                b *= 10;
                b += tmp.back() - '0';
                tmp.pop_back();
            }
        }
        if (gcd(a, M) != gcd(b, M)) continue;
        ll g = gcd(a, M);
        M /= g;
        ll mokuteki = (LL)(M - a % M) * (LL)(my_pow(b, C - 1, M)) % M;
        // mokuteki = 10^k
        map<ll, int> m;
        const int D = 1'000'000;
        ll base = 1;
        rep(i, 0, D){
            m[base] = i;
            base = base * 10 % M;
        }
        ll inv = my_pow(base, C - 1, M);
        ll tmp = 1;
        rep(i, 0, M / D + 1){
            ll val = (LL)(mokuteki) * (LL)(tmp) % M;
            if (m.count(val)){
                ll t = m[val] + (ll)i * D;
                t += C * 20;
                string tmp = to_string(a);
                cout << "3\n";
                cout << b << " 1\n";
                cout << "0 " << t - (int)(tmp.size()) << "\n";
                cout << tmp << " 1\n";
                return;
            }
            tmp = (LL)(tmp) * (LL)(inv) % M;
        }
        M *= g;
    }
}