#include <iostream>
#include <algorithm>
#include <vector>

using lint = long long;

void solve() {
    int n;
    std::cin >> n;

    std::vector<lint> ans;

    lint t = 1;
    for (int i = 0; i <= n; ++i) {
        lint f = 1;
        for (int j = 0; j <= n; ++j) {
            ans.push_back(t * f);
            f *= 5;
        }
        t *= 2;
    }

    std::sort(ans.begin(), ans.end());
    for (auto a : ans) {
        std::cout << a << std::endl;
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}