#include <iostream>
using namespace std;

typedef long long LL;
const int N = 1024;
int n;
int p[N], ans;

// 质因数分解 
int main()
{
    cin >> n;
    for (int i = 2; i <= n; ++i) {
        int a = i;
        for (int j = 2; j <= a / j; ++j) {
            if (a % j == 0) {
                while (a % j == 0) {
                    p[j]++;
                    a /= j;
                }
            }
        }
        if (a > 1) p[a]++;
    }
    
    for (int i = 2; i <= n; ++i) {
        if (p[i] > 0) {
            cout << i << " " << p[i] << endl;
        }
    }
    // 溢出风险 
    LL res = 1;
    for (int i = 2; i <= n; ++i) {
        if (p[i] > 0) {
            res = res * (p[i] + 1);
        }
    }
    cout << res << endl;
    return 0;
}