#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

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

int p;

int nrzero(long long n)
{
	int sol = 0;
	while (n > 1)
	{
		sol += n / 5;
		n /= 5;
	}
	return sol;
}

int main()
{
	long long sol = 0;
	fin >> p;
	long long st = 1, dr = 10000000000;
	while (st <= dr)
	{
		long long mij = (st + dr) / 2;
		int aux = nrzero(mij);
		if (aux == p)
		{
			sol = mij;
			dr = mij - 1;
		}
		else if (aux > p)
			dr = mij - 1;
		else
			st = mij + 1;
	}
	if (sol == 0)
		fout << -1;
	else 
		fout << sol;
	return 0;
}