lol3

from oef5 import is_prime
def count_circular_primes(maximum):
    sorted_list = []
    prime_list = []
    for i in range(2, maximum):
        sorted_list.append(i)

    for i in sorted_list:
        if sorted_list[i] == 0:
            continue
        for j in range(i+1, len(sorted_list)):
            if sorted_list[j] % sorted_list[i] == 0:
                sorted_list[j] = 0

    for i in range(len(sorted_list)):
        if sorted_list[i] != 0:
            prime_list.append(sorted_list[i])

    circular_prime_list = []
    str_list = []
    for i in prime_list:
        new_str = "".join(str(i))
        str_list.append(new_str)

    for string in str_list:
        if is_prime(int(string[::-1])) == True:
            circular_prime_list.append(int(string))
    return circular_prime_list