#include <iostream>
#include<cmath>
using namespace std;


long long q=1,p,k,st,dr,m,ok,M;
int main()
{
    cin>>p;
   st=1;dr=100000000; ok=0;
   while(st<=dr&&ok==0)
   {
       m=(st+dr)/2;
       M=m;
       k=0;q=5;
       while(M>=q)
       {
           k+=M/q;
           q=q*5;
       }
       if(k==p)
       {
           ok=1;
           m-=m%5;;
       }
        else if(k>p) dr=m-1;
        else st=m+1;
   }
   if(ok==0) cout<<"-1";
   else cout<<m;
    return 0;
}