def main():
    def f(n):
        d = 1; k = r = 0
        while d*d < n:
            if n % d == 0:
                k += 2
                if isprime(d) == 1: r += 1
                if isprime(n//d) == 1: r += 1
            d += 1
        if d*d == n:
            k += 1
            if isprime(d) == 1: r += 1
        if (k == 4) and (r == 2):
            return 1
        return 0

    def isprime(n):
        d = 2;k = 0
        while d*d < n:
            if n % d == 0:
                k += 2
                return 0
            d += 1
        if d*d == n: return 0
        return 1

    t = r = 0
    for i in range(1,1000000):
        if f(i) == 1:
            t += 1
            if t % 3 == 1:
                r += i
    otvet = [];d = 1
    while d*d < r:
        if r % d == 0:
            otvet.append(d)
            otvet.append((r//d))
        d += 1
    if d*d == r:
        otvet.append(d)
    print(otvet)
if __name__ == '__main__':
    main()