def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True


def print_first_15_primes():
    primes = []
    number = 2

    while len(primes) < 15:
        if is_prime(number):
            primes.append(number)
        number += 1

    print(primes)


if __name__ == "__main__":
    print_first_15_primes()