#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
                                                                                                
  
long long b( long long x, long long y ){

             long long z = 1;


             while( y != 0){

                    z *= x;

                    y -= 1;

                    }

             return z;

             }


int main(){
                                                                                                
   
    long long x, n, i, j, t, s;

    
    cin >> n;


    x = b(10,n);


    vector<long long> k;


    for( i = 1 ; i <= n ; i = i + 1 ){

         t = b(2,i);

         k.push_back(t);

         for( j = 1 ; j <= n ; j = j + 1 ){

              s = b(5,j);

              k.push_back(s);

              k.push_back(t*s);

              }

         }


    k.push_back(1);

    sort( k.begin(), k.end() );


    cout << k.at(0) << endl;

    for( i = 1 ; i < k.size() ; i = i + 1 ){

         if( k.at(i) != k.at(i - 1) )

         cout << k.at(i) << endl;

         }

    return 0;

}