#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <string>
#include <cmath>
using namespace std;

#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rREP(i, k, n) for (int i = (int)(n)-1; i >= k; i--)

#define debug(x) cerr<<#x<<": "<<x<<'\n'

#define F first
#define S second

#define vi vector<int>
#define pb push_back
#define mp make_pair

#define pcnt __builtin_popcount

typedef long long ll;

const int inf = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int n;
    long long a[500];
    cin >> n;
    rep(i,n+1){
      rep(j,n+1){
        a[i*(n+1)+j] = powl(2L,i)*powl(5L,j);
      }
    }
    sort(a,a+(n+1)*(n+1));
    rep(i,n+1){
      rep(j,n+1){
        cout << a[i*(n+1)+j] << endl;
      }
    }
    return 0;
}