#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <math.h>
#include <map>
using namespace std;

int main(){
	int n;
	cin >> n;
	
	vector<int> a(2*n,0);
	for(int i=0;i<2*n;i++){
		if(i<n){
			a[i]=2;
		}else{
			a[i]=5;
		}
	}
	
	vector<unsigned long long> output;
	for(int i=0;i<(1<<2*n);i++){
		vector<int> b(2*n,0);
		for(int j=0;j<2*n;j++){
			if(i&(1<<j)){
				b[j]=1;
			}else{
				b[j]=0;
			}
		}
		unsigned long long ans=1;
		for(int j=0;j<2*n;j++){
			if(b[j]==0)continue;
			ans*=b[j]*a[j];
		}
		output.push_back(ans);
	}
	sort(output.begin(),output.end());
	output.erase(unique(output.begin(),output.end()),output.end());
	for(int i=0;i<output.size();i++){
		cout << output[i] << endl;
	}
	return 0;
}