def countDivisors(n):
    if (n < 2):
        return 1
    count = 2
 
    for i in range(2, int(n/2)+1, 1):            # fix 1
        #print(i)                                # commented
        if(n%i == 0):
            count = count + 1
    return count
 
def main():
    print("The first 20 anti-primes are: ")
    maxDiv = 0                                   # fix 2
    count = 0                                    # fix 3
    n = 1
    while count < 20:    
        d = countDivisors(n)
        if(d > maxDiv):
            print(n)
            maxDiv = d
            count += 1
        n += 1                                   # fix 4
    return 0
 
main()

ZGVmIGNvdW50RGl2aXNvcnMobik6CiAgICBpZiAobiA8IDIpOgogICAgICAgIHJldHVybiAxCiAgICBjb3VudCA9IDIKCiAgICBmb3IgaSBpbiByYW5nZSgyLCBpbnQobi8yKSsxLCAxKTogICAgICAgICAgICAjIGZpeCAxCiAgICAgICAgI3ByaW50KGkpICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAjIGNvbW1lbnRlZAogICAgICAgIGlmKG4laSA9PSAwKToKICAgICAgICAgICAgY291bnQgPSBjb3VudCArIDEKICAgIHJldHVybiBjb3VudAoKZGVmIG1haW4oKToKICAgIHByaW50KCJUaGUgZmlyc3QgMjAgYW50aS1wcmltZXMgYXJlOiAiKQogICAgbWF4RGl2ID0gMCAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIyBmaXggMgogICAgY291bnQgPSAwICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIyBmaXggMwogICAgbiA9IDEKICAgIHdoaWxlIGNvdW50IDwgMjA6ICAgIAogICAgICAgIGQgPSBjb3VudERpdmlzb3JzKG4pCiAgICAgICAgaWYoZCA+IG1heERpdik6CiAgICAgICAgICAgIHByaW50KG4pCiAgICAgICAgICAgIG1heERpdiA9IGQKICAgICAgICAgICAgY291bnQgKz0gMQogICAgICAgIG4gKz0gMSAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIyBmaXggNAogICAgcmV0dXJuIDAKICAgIAptYWluKCk=