#include <fstream>


using namespace std;


ifstream f("fact.in");
ofstream g("fact.out");

long long  five( long long n){
	return n / 5;
}

long long binarysearch(int n, int p){
	long long lo, hi, mid;
	lo = 0;
	hi = n+1;
	while ( hi - lo > 1){
		mid =( lo + hi ) /2;
			if (  five(mid) > p )
				hi = mid;
			else
				lo = mid;
	}
	return lo;
}


int main(){
	int p, nr = 1, i;
	f >> p;	
	if ( p == 0 ){
		g << 1;
		return 0;
	}
    p = binarysearch(5*p, p);
    g << p;

}