#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
unsigned long long int pow10(int x,int n){
    if(n==0){
        return 1;
    }else{
        return x*pow10(x,n-1);
    }
}

int main(){
int n;
cin>> n;
unsigned long long int b[(n+1)*(n+1)+1];
for(int i=0;i<=n;i++){
    for(int j=0;j<=n;j++){
        b[i*3+j]=pow10(2,i)*pow10(5,j);

    }
}
int max =(n+1)*(n+1);
sort(b,b+max+1);
for(int i=0;i<=(n+1)*(n+1);i++){
        if(b[i]<1){
        continue;
    }
    if(b[i]>pow(10,n)){
        break;
    }
cout<<b[i]<<endl;
}
}