#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>

using namespace std;

typedef long long unsigned int ll;

#define rep(i,n)for(i=0;i<n;i++)
#define FOR(i,a,n) for(i=a;i<n;i++)
#define ALL(s)s.begin(), s.end()

#define INF (1e9)
#define PI  (acos(-1))




int main()
{
	int N;
	cin >> N;
	vector<ll> vi;

	for (int k = 0; k <= N; k++) {
		for (int j = 0; j <= N; j++) {
			vi.push_back(pow(2,k) * pow(5,j));
		}
	}

	sort(ALL(vi));

	for (int k = 0; k < vi.size(); k++) {
		cout << vi[k] << endl;
	}

	return 0;
}