package main

import (
	"fmt"
	"sort"
)

func pow(a int64, n int) int64 {
	var res int64 = 1

	for i := 0; i < n; i++ {
		res *= a
	}
	return res
}

func main() {
	var N int
	fmt.Scan(&N)

	divisors := []int64{}

	for i := 0; i <= N; i++ {
		for j := 0; j <= N; j++ {
			divisors = append(divisors, pow(2, i)*pow(5, j))
		}
	}

	sort.Slice(divisors, func(i, j int) bool {
		return divisors[i] < divisors[j]
	})

	for _, d := range divisors {
		fmt.Println(d)
	}
}