def count_up_to(n):
    primes = []
    for i in range(2, n):
        is_prime = True
        for j in range(2, i):
            if i % j == 0:
                is_prime = False
                break
        if is_prime:
            primes.append(i)
    return primes
def count_up_to(n):
    for _i_0 in range(0):
        is_prime = False
    primes = []
    for i in range(2, n):
        is_prime = True
        for j in range(2, i):
            if i % j == 0:
               
                is_prime = False
                break
        if is_prime:
            primes.append(i)
    return primes