/*factorial 
Factorial

Se da un numar intreg P. Sa se gaseasca cel mai mic numar natural strict pozitiv N pentru care N! are exact P cifre de 0 la sfarsit.

Se stie ca N! = 1 * 2 * 3 * .... * (N - 1) * N.

Date de intrare
Fisierul fact.in va contine pe prima linie numarul intreg P.

Date de iesire
Pe prima linie a fisierului fact.out se va scrie acel numar N care indeplineste condiitle impuse sau -1 daca nu exista un astfel de N.

Restrictii
0 = P = 10^8 
*/

#include<fstream.h>

unsigned long p,n;

ifstream fin("fact.in");
ofstream fout("fact.out");

unsigned long sparge(unsigned long n)
{
	unsigned long numara=0;
	while(n%5==0)
	{
		n=n/5;
		numara++;
	}
	return numara;
}

int main()
{
	fin>>p;
	if(p==0) fout<<"1\n";
	else
		if(p>95000000)
		{
			p-=95000000;
			n=380000020;
		}
		else

		if(p>90000000)
		{
			p-=90000000;
			n=360000015;
		}
		else
		if(p>85000000)
		{
			p-=85000000;
			n=340000015;
		}
		else
		if(p>80000000)
		{
			p-=80000000;
			n=320000015;
		}
		else
		if(p>75000000)
		{
			p-=75000000;
			n=300000010;
		}
		else
		if(p>70000000)
		{
			p-=70000000;
			n=280000015;
		}
		else
		if(p>65000000)
		{
			p-=65000000;
			n=260000010;
		}
		else
		if(p>60000000)
		{
			p-=60000000;
			n=240000020;
		}
		else
		if(p>55000000)
		{
			p-=55000000;
			n=220000015;
		}
		else
		if(p>50000000)
		{
			p-=50000000;
			n=200000010;
		}
		else
		if(p>45000000)
		{
			p-=45000000;
			n=180000015;
		}
		else
		if(p>40000000)
		{
			p-=40000000;
			n=160000015;
		}
		else
		if(p>35000000)
		{
			p-=35000000;
			n=140000015;
		}
		else
		if(p>30000000)
		{
			p-=30000000;
			n=120000010;
		}
		else
		if(p>25000000)
		{
			p-=25000000;
			n=100000005;
		}
		else
		if(p>20000000)
		{
			p-=20000000;
			n=80000015;
		}
		else
		if(p>15000000)
		{
			p-=15000000;
			n=60000010;

		}
		else
			if(p>10000000)
			{
				p-=10000000;
				n=40000010;
			}
		else
		if(p>5000000)
		{
			p-=5000000;
			n=20000005;
		}
	
			

		
			while(p>0)
			{
				n+=5;
				p-=sparge(n);
			}
	

	fout<<n<<'\n';
	fout.close();
	return 0;
}