#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	vector<pair<int,int> >vt;
	int sq=sqrt(n);
	for(int i=2;i<=sq;i++){
		if(n%i==0){
			int cnt=0;
			while(n%i==0){
				n/=i;
				++cnt;
			}
			vt.push_back({i,cnt});
		}
	}
	if(n>1)vt.push_back({n,1});
	sort(vt.begin(),vt.end());
	cout<<vt.size()<<"\n";
	for(int i=0;i<vt.size();i++){
		cout<<vt[i].first<<" "<<vt[i].second<<"\n";
	}
//Author: Bao Dat
}

`color(#5C73B9ff)(H)color(#6B68C0ff)(o)color(#795DC6ff)(r)color(#8852CDff)(i)color(#9646D4ff)(z)color(#A53BDAff)(o)color(#B330E1ff)(n)`

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

void tsnt(long long n) {
    vector<pair<int, int>> so;

    for (int i = 2; i * i <= n; i++) {
        int dem = 0;
        while (n % i == 0) {
            dem++;
            n /= i;
        }
        if (dem > 0) so.push_back({i, dem});
    }

    if (n > 1) so.push_back({n, 1});

    cout << so.size() << '\n';

    for (const auto& pair : so) cout << pair.first << " " << pair.second << '\n';
}

int main() {
    long long n;
    cin >> n;
    tsnt(n);
    return 0;
}