#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long LL;
int main(int argc, char* argv[])
{
	int N;
	cin>>N;
	LL n2=1;
	LL n5;
	vector<LL> A;
	int i;
	for (i=0;i<=N;i++){
		n5=1;
		for (int j=0;j<=N;j++){
			A.push_back(n2*n5);
			n5*=5;
		}
		n2*=2;
	}
	sort(A.begin(),A.end());
	for (i=0;i<A.size();i++){
		cout<<A[i]<<endl;
	}
	return 0;
}