Решето Эратосфена

n = int(input())
s = []
s1 = []
p = 0
for i in range(2, n + 1):
    s.append(i)
    p = s[0]


def get_int(p):
    for l in range(len(s)):
        for j in range(2, n + 1, p):
            if p == s[l]:
                continue
            else:
                if s[l] % p == 0:
                    s[l] = 0
    for h in range(len(s)):
        if s[h] != p:
            if s[h] > p:
                p = s[h]
                break
        else:
            p = 0
    return p



while p != 0:
    p = get_int(p)

for k in range(len(s)):
    if s[k] != 0:
        s1.append(s[k])
print(s1)