#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitset>
#include <iterator>
#include <iomanip>
#include <sstream>
#include <numeric>
#define INF 2000000000
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
long long gcd(long long a,long long b){if(a%b==0){return b;}else return gcd(b,a%b);}
long long lcm(long long a,long long b){if(a==0){return b;} return a/gcd(a,b)*b;}
long long MOD; template<class T> void mod(T &n){MOD=n;}
#define sym cout<<"---------"<<endl;
#define ll long long
#define PL pair<long long, long long>
#define P pair<int,int>
#define mk make_pair
#define en endl
#define WHITE 1
#define BLACK 2
#define GRAY 1
#define RE return 0
#define int ll

int two[20];
int five[20];
set<int> s;

signed main(){
  int n;
  cin>>n;
  
  two[0]=1;
  five[0]=1;
  for(int i=1; i<=n; i++){
    two[i]=two[i-1]*2;
  }
  for(int i=1; i<=n; i++){
    five[i]=five[i-1]*5;
  }
  
  for(int i=0; i<=n; i++){
    for(int j=0; j<=n; j++){
      s.insert(two[i]*five[j]);
    }
  }
  
  for(set<int>::iterator ite=s.begin(); ite!=s.end(); ite++){
    cout<<*ite<<en;
  }
  
}