#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#include <queue>
#include <stack>

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define REP(i,a,n) for(long long i = (a);i < (n);i++)
#define PI 3.14159265359
#define MOD 1000007
#define chmax(a,b) if(a < b)a = b

using namespace std;

int main(){
    int n;
    cin >> n;
    vector<long long> l;
        REP(j, 0, n+1){
        long long a = pow(2,j);
            REP(h, 0, n+1){
                if(h > 0)a*=5;
        l.push_back(a);
            }
        }
    sort(ALL(l));
    REP(i, 0, l.size()){
        cout << l[i] << endl;
    }
    return 0;
}