#include <stdio.h>
#include <string.h>
#define N 105
#define P 10000
#define NR 10
int v[N],numar,exp,find,caz,nr[P],op[P];
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;
	}
}
void mul(int A[], int B[])
{
      int i, j, t, C[P];
      memset(C, 0, sizeof(C));
      for (i = 1; i <= A[0]; i++)
      {
              for (t=0, j=1; j <= B[0] || t; j++, t/=10)
                      C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;
              if (i + j - 2 > C[0]) C[0] = i + j - 2;
      }
      memcpy(A, C, sizeof(C));
}
int cbin(int x)
{
	int st=1,dr=2000,m,i,caz,salv,t;
	while (st!=dr)
	{
		m=(st+dr+1)/2;
		for (i=0; i<=P; i++)
		{
			nr[i]=0;
			op[i]=0;
		}
		salv=m;
		while (salv)
		{
			op[++op[0]]=salv%10;
			salv/=10;
		}
		nr[0]=1;
		nr[1]=1;
		caz=-1;
		salv=x;
		while (salv)
		{
			if (salv%2)
				mul(nr,op);
			mul(op,op);
			salv/=2;
		}
		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;
		op[i]=0;
	}
	salv=st;
	while (salv)
	{
		op[++op[0]]=salv%10;
		salv/=10;
	}
	nr[0]=1;
	nr[1]=1;
	salv=x;
	while (salv)
	{
		if (salv%2)
			mul(nr,op);
		mul(op,op);
		salv/=2;
	}
	if (nr[0]!=v[0])
		return -1;
	for (i=1; i<=v[0]; i++)
		if (v[i]!=nr[i])
			return -1;
	return st;
}
void solve()
{
	int i,j,t=-1;
	for (i=150; i>=1; i--)
	{
		t=cbin(i);
		if(t!=-1)
		{
			numar=t;
			exp=i;
			break;
		}
	}
}
int main()
{
	freopen("numere2.in","r",stdin);
	freopen("numere2.out","w",stdout);
	read();
	solve();
	printf("%d\n%d\n",numar,exp);
	return 0;
}