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

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using mint = modint998244353;

map<ll, int> fact(ll N) {
    map<ll, int> mp;
    for(ll p = 2; p * p <= N; p++) {
        while(N % p == 0) {
            mp[p]++;
            N /= p;
        }
    }
    if(N > 1) mp[N]++;
    return mp;
}

ll phi(ll N) {
    ll ret = N;
    map<ll, int> mp = fact(N);
    for(auto [p, _] : mp) {
        ret /= p;
        ret *= p - 1;
    }
    return ret;
}

ll rev(ll N) {
    ll ret = 0;
    while(N) {
        ret *= 10;
        ret += N % 10;
        N /= 10;
    }
    return ret;
}

int main() {
    ll N;
    cin >> N;
    map<ll, int> mp = fact(N);
    if(mp.count(2)) {
        if(mp.size() == 1) {
            cout << 3 << endl;
            cout << rev(N) << " " << 1 << endl;
            cout << 0 << " " << 100 << endl;
            cout << N << " " << 1 << endl;
            return 0;
        }
    }else if(mp.count(5)) {
        if(mp.size() == 1) {
            cout << 3 << endl;
            cout << rev(N) << " " << 1 << endl;
            cout << 0 << " " << 100 << endl;
            cout << N << " " << 1 << endl;
            return 0;
        }
    }else {
        cout << 1 << endl;
        cout << 9 << " " << phi(N) * 100 << endl;
    }
}