#include <iostream>
#include <fstream>
#include <math.h>
long n;
using namespace std;
int factorial (int n)
{   int i;
     long p=1;
    for (i=1;i<=n;i++)
        p*=i;
}
int main()
{   long P,p,s;
int ok;
      ifstream f("fact.in");
    ofstream g("fact.out");
    f>>P;
    ok=1;
    n=1;
    while (ok!=0 && n<=100000000)
    {
    s=factorial (n);
    p=pow(10,P);
        if (s%p==0)
        {
            g<<n;
            ok=0;
        }
    }

    if(n>100000000)
        g<<-1;

    return 0;
}