from sympy import prime, factorint

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 a209636(n):
    n = 2*n
    m = 1
    if n<2: return 1
    while n>1:
        if n%2==0:
            n/=2
            m*=2
        else:
            n=(n - 1)/2
            m=prime(m)
    return m

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

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