#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

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

long long factorial(long long n)
{long long  p=0;
    for(int i=1;i<=log(n)/log(5);i++)
        p = p + (n/(pow(5,i)));

    return p;
}

long long cautare(long long p, long long a, long long b)
{long long c;

    while(p != factorial((a+b)/2))
    {

       if(factorial((a+b)/2) > p) b = (a+b)/2;
       else if(factorial((a+b)/2) < p) a = (a+b)/2;

    }

    c = (a+b)/2;
    while(c%5 != 0) c--;
    return c;
}


int main()
{long long p;
    f>>p;
    g<<cautare(p,0,10000);

}