def divisors_count(n):
    count = 0
    for i in range(1, n + 1):
        if n % i == 0:
            count += 1
    return count


print(divisors_count(1))
print(divisors_count(5))
print(divisors_count(42))
print(divisors_count(127))
print(divisors_count(1024))


def is_prime(n):
    return divisors_count(n) == 2


print(is_prime(1))  # False
print(is_prime(2))  # True
print(is_prime(3))  # True
print(is_prime(42))  # False
print(is_prime(127))  # True


def primes(count):
    n = 1
    counter = 0
    while counter < count:
        if is_prime(n):
            print(n, end=" ")
            counter += 1
        n += 1
    print()


primes(2)
primes(5)
primes(10)


def twin_primes(count):
    n = 2
    counter = 0
    while counter < count:
        if is_prime(n) and is_prime(n + 2):
            print(str(n) + "-" + str(n + 2), end=" ")
            counter += 1
        n += 1
    print()


twin_primes(2)
twin_primes(5)
twin_primes(10)


def factorial(n):
    value = 1
    for i in range(1, n + 1):
        value *= i
    return value


def n_factorials_print(n):
    for i in range(n):
        print(factorial(i), end=" ")


n_factorials_print(8)


def n_factorials_return(n):
    output = ""
    for i in range(n):
        output += str(factorial(i)) + " "
    return output

print(n_factorials_return(8))


def string_with_spaces(string):
    for i in range(len(string)):
        print(string[i], end=" ")


def string_with_spaces2(string):
    for char in string:
        print(char, end=" ")

string_with_spaces("TESTER")
print()
string_with_spaces2("TESTER")