#include<algorithm>
#include<cmath>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
#define repl(i,s,e) for(int i=s;i<e;i++)
#define reple(i,s,e) for(int i=s;i<=e;i++)
#define revrep(i,n) for(int i=n-1;i>=0;i--)
#define all(x) (x).begin(),(x).end()

int main()
{	
	int N;
	cin >> N;

	vector<ll> factors;

	ll x = 1;
	reple(i, 0, N)
	{
		ll y = 1;

		reple(j, 0, N)
		{
			factors.push_back(x * y);
			y *= 5;
		}

		x *= 2;
	}

	sort(all(factors));

	for (auto x : factors)
	{
		cout << x << endl;
	}

	return 0;
}