#include <stdio.h>
#include <string.h>
#define N 105
#define P 10000
#define NR 1000000000
#define Q 10000000
#define S 10000000
int v[N],numar,exp,find,caz,nr[P],baze[S/10],r,divizor=1;
void read()
{
	char x;
	while(scanf("%c",&x)!=EOF)
		if (x>='0' && x<='9')
			v[++v[0]]=x-'0';
	int i,t;
	for (i=1; i<=v[0]/2; i++)
	{
		t=v[i];
		v[i]=v[v[0]-i+1];
		v[v[0]-i+1]=t;
	}
}
int mod(int A[], int B)
{
      int i, t = 0;
      for (i = A[0]; i > 0; i--)
              t = (t * 10 + A[i]) % B;
      return t;
}
void mul(int A[], int B)
{
      int i, t = 0;
      for (i = 1; i <= A[0] || t; i++, t /= 10)
              A[i] = (t += A[i] * B) % 10;
      A[0] = i - 1;
}
int cbin(int x)
{
	int st=1,dr=r,m,i,caz;
	while (st!=dr)
	{
		m=(st+dr+1)/2;
		for (i=0; i<=P; i++)
			nr[i]=0;
		nr[0]=1;
		nr[1]=1;
		caz=-1;
		for (i=1; i<=x; i++)
			mul(nr,baze[m]);
		if (v[0]>nr[0])
			caz=1;
		if (v[0]<nr[0])
			caz=0;
		if (caz==-1)
			for (i=v[0]; i>=1; i--)
			{
				if (v[i]>nr[i])
				{
					caz=1;
					break;
				}
				if (v[i]<nr[i])
				{
					caz=0;
					break;
				}
			}
		if (caz==-1)
			caz=1;
		if (caz==1)
			st=m;
		else
			dr=m-1;
	}
	for (i=0; i<=P; i++)
		nr[i]=0;
	nr[0]=1;
	nr[1]=1;
	for (i=1; i<=x; i++)
		mul(nr,baze[st]);
	if (nr[0]!=v[0])
		return -1;
	for (i=1; i<=v[0]; i++)
		if (v[i]!=nr[i])
			return -1;
	return baze[st];
}
void solve()
{
	int i,t=-1;
	for (i=150; i>=1; i--)
	{
		t=cbin(i);
		if(t!=-1)
		{
			numar=t;
			exp=i;
			break;
		}
	}
}
char prim(int x)
{
	if (x==1)
		return 0;
	if (x==2)
		return 1;
	if (x%2==0)
		return 0;
	int i;
	for (i=3; i*i<=x; i+=2)
		if (x%i==0)
			return 0;
	return 1;
}
int main()
{
	freopen("numere2.in","r",stdin);
	freopen("numere2.out","w",stdout);
	read();
	int i,rest;
	for (i=2; i<=1000; i++)
	{
		rest=mod(v,i);
		if (rest==0)
			if (prim(i))
				divizor*=i;
	}
	for (i=divizor; i<=Q; i+=divizor)
	{
		rest=mod(v,i);
		if (rest==0)
			baze[++r]=i;
	}
	solve();
	printf("%d\n%d\n",numar,exp);
	return 0;
}