#include <fstream>
#include <iostream>
#include <limits.h>
using namespace std;

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

const int MAX = 1e15 + 1;

int countZeroes(int val)
{
    if (val == 0)
        return 1;
    int cnt = 0;
    for (int i = 5; i <= val; i *= 5)
        cnt += val / i;
    return cnt;
}

int binSearch(int val)
{
    int left = 1, right = INT_MAX, res = INT_MAX;
    while (left <= right)
    {
        int mid = (left + right) / 2;
        int q = countZeroes(mid);
        if (q >= val)
        {
            if (q == val && mid < res)
                res = mid;
            right = mid - 1;
        }
        else
            left = mid + 1;
    }
    return res;
}

int main()
{
    int n;
    fin >> n;
    fout << binSearch(n);
    return 0;
}