1 #include<iostream>
 2 #include<cstdio>
 3 #include<algorithm>
 4 #include<cmath>
 5 #include<cstring>
 6 #include<set>
 7 #include<vector>
 8 #include<queue>
 9 #include<map>
10 #include<list>
11 #include<bitset>
12 #include<string>
13 #include<cctype>
14 #include<cstdlib>
15 #include<sstream>
16
17 using namespace std;
18
19 typedef long long ll;
20 typedef unsigned long long ull;
21 #define inf (0x3f3f3f3f)
22 #define lnf (0x3f3f3f3f3f3f3f3f)
23 #define eps (1e-8)
24 int sgn(double a) {
25     return a < -eps ? -1 : a < eps ? 0 : 1;
26 }
27
28 const int maxn=1<<16;
29 bool vis[maxn];
30 int prime[maxn];
31
32 int Euler_prime() {
33     memset(vis, true, sizeof(vis));
34     int tot = 0;
35     for (int i = 2; i < maxn; i++) {
36         if (vis[i]) prime[tot++] = i;
37         for (int j = 0; j < tot&&prime[j] * i < maxn; j++) {
38             vis[i*prime[j]] = false;
39             if (i%prime[j] == 0) break;
40         }
41     }
42     return tot;
43 }
44 string line;
45
46
47
48 void solve() {
49     int pn=Euler_prime();
50     while(getline(cin,line)){
51         if(line=="0")break;
52         ll sum=1;
53         int p,e;
54         stringstream ss(line);
55         while(ss>>p>>e){
56             for(int i=0;i<e;i++){
57                 sum*=p;
58             }
59         }
60         sum--;
61         for(int i=pn-1;i>=0;i--){
62             if(sum%prime[i]==0){
63                 cout<<prime[i]<<" ";
64                 int e=0;
65                 while(sum%prime[i]==0){
66                     sum/=prime[i];
67                     e++;
68                 }
69                 cout<<e<<" ";
70             }
71             if(sum==1)break;
72         }
73         cout<<endl;
74
75     }
76 }
77
78
79
80 int main() {
81
82 #ifndef ONLINE_JUDGE
83     freopen("in.txt", "r", stdin);
84     //freopen("out.txt", "w", stdout);
85 #endif
86     iostream::sync_with_stdio(false);
87     solve();
88     return 0;
89 }