Buggy python submission (verdict: Time Limit Exceeded):
numberOfInput=int(input())
primeNumbers=[]

def isPrime(researchNumber):
    for devidedBy in range(1,researchNumber+1):
        if researchNumber%devidedBy==0 and devidedBy!=1 and devidedBy!=researchNumber:
            break
        elif researchNumber%devidedBy==0 and devidedBy==researchNumber:
            primeNumbers.append(researchNumber)


#----------------------------------main------------------------------------------
while numberOfInput>0:
    researchNumber=int(input())
    if researchNumber==1:
        pass
    else:
        isPrime(researchNumber)
    numberOfInput-=1
print(len(primeNumbers))


Fixed submission:
n =  int(input())
index=0
count=0
while index<n:
    number = int(input())
    stock =[]
    devideN = 1
    while devideN <= number:
        if len(stock)>2:
            break
        elif devideN==10000:
            stock.append(devideN)
            break
        elif number%devideN==0:
            if devideN!=1 and devideN!=number:
                break
            else:
                stock.append(devideN)
        else:
            pass
        devideN+=1
    if len(stock) == 2:
        count+=1
    index+=1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
numberOfInput=int(input())
primeNumbers=0

while numberOfInput>0:
    researchNumber=int(input())
    if researchNumber==1:
        pass
    else:
        for devidedBy in range(1,researchNumber+1):
            if researchNumber%devidedBy==0 and devidedBy!=1 and devidedBy!=researchNumber:
                break
            elif researchNumber%devidedBy==0 and devidedBy==researchNumber:
                primeNumbers+=1
    numberOfInput-=1

print(primeNumbers)


Fixed submission:
n =  int(input())
index=0
count=0
while index<n:
    number = int(input())
    stock =[]
    devideN = 1
    while devideN <= number:
        if len(stock)>2:
            break
        elif devideN==10000:
            stock.append(devideN)
            break
        elif number%devideN==0:
            if devideN!=1 and devideN!=number:
                break
            else:
                stock.append(devideN)
        else:
            pass
        devideN+=1
    if len(stock) == 2:
        count+=1
    index+=1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
numberOfInput=int(input())
primeNumbers=0

while numberOfInput>0:
    researchNumber=int(input())
    if researchNumber==1:
        pass
    else:
        for devidedBy in range(1,researchNumber+1):
            if researchNumber%devidedBy==0 and devidedBy!=1 and devidedBy!=researchNumber:
                break
            elif researchNumber%devidedBy==0 and devidedBy==researchNumber:
                primeNumbers+=1
    numberOfInput-=1

print(primeNumbers)


Fixed submission:
n =  int(input())
index=0
count=0
while index<n:
    number = int(input())
    stock =[]
    devideN = 1
    while devideN <= number:
        if len(stock)>2:
            break
        elif devideN==10000:
            stock.append(devideN)
            break
        elif number%devideN==0:
            if devideN!=1 and devideN!=number:
                break
            else:
                stock.append(devideN)
        else:
            pass
        devideN+=1
    if len(stock) == 2:
        count+=1
    index+=1
print(count)