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

#Python 2.7.11, OEIS sequence: A278235

from sympy import prime, factorint
from operator import mul
import collections

def P(n):
    f = factorint(n)
    return sorted([f[i] for i in f])

def a046523(n):
    x=1
    while True:
        if P(n) == P(x): return x
        else: x+=1

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

def a275735(n):
    y=collections.Counter(map(int, list(str(a007623(n)).replace("0", "")))).most_common()
    return 1 if n==0 else reduce(mul, [prime(y[i][0])**y[i][1] for i in xrange(len(y))])

def a(n): return a046523(a275735(n))

print [a(n) for n in xrange(201)]