---

def M(n):
    divs = []
    for j in range(2, int(n**0.5)+1):
        if n % j == 0:
            divs.append(j)
        while n % j == 0:
            n //= j
    divs.sort()
    return divs[0] + divs[-1] if divs else 0


c = 0

for ii in range(75000, 100*75000):
    i = ii * 100 + 32
    m = M(i)
    if i % 100 == 23 and m != 0 and i % m == 0:
        c += 1
        print(i)
    if c == 5:
        break