https://www.v2ex.com/t/881419

prime.py

from math import ceil, sqrt


def isprime(n):
    for x in range(2, ceil(sqrt(n + 1))):
        if n % x == 0:
            return False
    return True


def prime(n):
    if n == 0:
        return

    print("2 ", end=" ")
    counter = 1
    x = 3
    while counter < n:
        if isprime(x):
            print(x, "", end=" ")
            counter += 1
        x += 2
        if counter % 10 == 0:
            print()


n = int(input())
prime(n)