def s(n):
    return sum(i for i in range(1,n) if n%i==0)
def f(l):
    a=[]
    for n in range(1,l+1):
        t=s(n)
        if t>n and s(t)==n:
            a.append((n,t))
    return a
l=10000
p= f(l)
for p2 in p:
    print(p2)

n = 10000
dd = [0] * (n + 1)
a = []
for i in range(1, n // 2 + 1):
    for j in range(2 * i, n + 1, i):
        dd[j] += i
for i in range(1, n + 1):
    t = dd[i]
    if t > i and t <= n and dd[t] == i:
        a.append((i, t))
for i in a:
    print(i)