#########################################################
#                                                       #
#    Coded by Indranil Ghosh (indranilg49@gmail.com)    #     
#                                                       #
#########################################################

#Python 2.7.11, OEIS sequence: A275723

from sympy import prime, factorial as f

def a007623(n, p=2): return n if n<p else a007623(int(n/p), p+1)*10 + n%p

def a084558(n): return 0 if n==0 else len(str(a007623(n)))

def a099563(n):
    i=2
    d=0
    while n:
        d=n%i
        n=(n - d)/i
        i+=1
    return d

def a249344(n, k):
    p=prime(n)
    i=z=0
    while p**i<=k:
        if k%(p**i)==0: z=i
        i+=1
    return z

def a257678(n):
    x=str(a007623(n))[1:][::-1]
    return sum([int(x[i])*f(i + 1) for i in xrange(len(x))]) 

def a273673(n, k):
    e=a249344((1 + a084558(k)), n)
    return (n/ prime(1 + a084558(k))**e)*prime(1 + a084558(k) - a099563(k))**e

def A(n, k): return n if k==0 else A(a273673(n, k), a257678(k))

for n in xrange(1, 21): print [A(k, n - k) for k in xrange(1, n + 1)]