8587340257
 9
 81
 27
 1408514752349
 25
 49380563
 266418
 319757451841
 6599669076000
 8
 1000000000000
 30971726
 274875809788
 64
 34280152201
 236
 472670214391
 7938986881993
 44
 4
 388
 2
 802241960524
 3047527844089
 5
 12
 614125
 1716443237161
 48855707
 99
 9999925100701
 5839252225
 3
 50
 1307514188557
 9999926826034
 1468526771489
 2975
 8110708459517
 401120980262
 5138168457911
 1245373417369
 128
 16
 2000000014
 445538663413
 57461344602
 324
 7420738134810

1
9409 2 1
9 1
9 1
72361 2 1
289 1
6 1
289 1
4 1
4 1
4 2 1
4 1
4 2 1
4 1
23020027 1
378028993 1
4 2 1
4 1
0 1
4 2 1
0 1
4 1
25 1
5329 1
2603 1
9 1
0 1
25 1
0 1
10 1
39283 2 1
613783 1
25 2 2 2 1
908209 1
4 1
4 2 1
0 1
6 1
4 1
6
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <map>
#include <vector>
#include <queue>
#include <set>
using namespace std;
#define N 5000000
#define LL __int64
bool o[5000001];
int prim[5000001];
int num;
int judge(LL n)
{
    int i;
    for(i = 0;i < num;i ++)
    {
        if(n == prim[i])
        return 1;
        if(n%prim[i] == 0)
        {
            return 0;
        }
    }
    return 1;
}
int main()
{
    int i,j;
    LL n,ans;
    num = 0;
    for(i = 2; i <= N; i ++)
    {
        if(o[i] == 0)
        {
            prim[num++] = i;
            for(j = i+i; j <= N; j += i)
            {
                o[j] = 1;
            }
        }
    }
    cin>>n;
    if(n == 1||judge(n))
    {
        cout<<"1\n0\n";
        return 0;
    }
    ans = 1;
    j = 1;
    for(i = 0;i < num;i ++)
    {
        if(n%prim[i] == 0&&judge(n/prim[i]))
        {
            cout<<"2\n";
            return 0;
        }
        if(n%prim[i] == 0&&j <= 2)
        {
            ans *= prim[i];
            j ++;
        }
    }
    cout<<"1\n"<<ans<<endl;
    return 0;
}
