#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
#define N 201
#define mod 98999
typedef long long int;
int n, mid, sol = 1e8, x;

int evp(int n) {
	int pw = 5;
	int cnt = 0;
	while (pw <= n) {
		cnt += n / pw;
		pw *= 5;
	}
	return cnt;
}

void find(int l, int r) {
	while (l <= r) {
		mid = (l + r) / 2;
		x = evp(mid);
		if (x > n)
			r = mid - 1;
		else {
			if (x < n)
				l = mid + 1;
			else {
				sol = min(sol, mid);
				r = mid - 1;
			}

		}

	}
}

int main() {
	fin >> n;
	find(1, sol);
	fout << sol;
}