Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#16D8101014F 久留米 竜之介 Python
from collections import deque

n,time=map(int,input().split())
timenow = 0
p=[]
q=[]
queue=[] #p1,p2....
Queue=[] #time
for i in range (n):
	line=input().split()
	q.append(int(line.pop()))
	p.append(line.pop())

print(len(p))
while len(p) is not 0:
	Ptmp=p.deque()
	if Ptmp<=100:
		timenow+=Ptmp
		queue.append(q.deque())
		Queue.append()
	else:
		timenow+=100
		Ptmp-=100
		q.append(ptmp)
		p.append(p.deque())#??
		
print(queue,Queue)
		
		


Fixed submission:
#16D8101014F 久留米 竜之介 Kurume Ryunosuke Python
All = 0
q = []
Queue = []
tmp,time = map(int,input().split())
for i in range(tmp):
    p,zi =input().split()
    q.append([p,int(zi)])
while len(q) > 0:
    if q[0][1]<= time:
        All+=q[0][1]
        v=q.pop(0)
        Queue.append([v[0],All])
    else:
        All+=time
        q[0][1]-=time
        last=q.pop(0)
        q.append(last)
for i in range(len(Queue)):
    print("{0} {1}".format(Queue[i][0],Queue[i][1]))

Buggy python submission (verdict: Runtime Error):
#16D8101014F 久留米 竜之介 Python

n,time=map(int,input().split())
timenow = 0
p=[]
q=[]
queue=[] #p1,p2....
Queue=[] #time
for i in range (n):
	line=input().split()
	q.append(int(line.pop()))
	p.append(line.pop())

head=0
tail=len(p)-1
while head is not tail:
	#print(p)
	#print(q)
	#print(head,tail)
	Ptmp=q[head]
	if Ptmp<=time:
		timenow+=Ptmp
		queue.append(p[head])
		Queue.append(timenow)
		head+=1
	else:
		timenow+=time
		Ptmp-=time
		q.append(Ptmp)
		p.append(p[head])
		head+=1
		tail+=1
Ptmp=q[head]
timenow+=Ptmp
queue.append(p[head])
Queue.append(timenow)

for i in range(n):
		print(queue[i],Queue[i])
		


Fixed submission:
#16D8101014F 久留米 竜之介 Kurume Ryunosuke Python
All = 0
q = []
Queue = []
tmp,time = map(int,input().split())
for i in range(tmp):
    p,zi =input().split()
    q.append([p,int(zi)])
while len(q) > 0:
    if q[0][1]<= time:
        All+=q[0][1]
        v=q.pop(0)
        Queue.append([v[0],All])
    else:
        All+=time
        q[0][1]-=time
        last=q.pop(0)
        q.append(last)
for i in range(len(Queue)):
    print("{0} {1}".format(Queue[i][0],Queue[i][1]))
Buggy python submission (verdict: Time Limit Exceeded):

n=int(input())
S=[]
S=input().split()
q=int(input())
T=[]
T=input().split()
point=0
for i in range(q):	
	for j in range(n):
		if T[i]==S[j]:
			point+=1
			break
			
print(point)


Fixed submission:
#16D8101014F 久留米 竜之介 2018/5/14
n=int(input())
S=list(map(int,input().split()))
q=int(input())
T=list(map(int,input().split()))
point=0
for i in T:
	left=0
	right=n
	while left < right:
		mid=int((left+right)/2)
		if S[mid] == i:
			point += 1
			break
		elif i < S[mid]:
			right = mid
		else:
			left = mid + 1
	#print(i,point)

print(point)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
S=[]
S=input().split()
q=int(input())
T=[]
T=input().split()
point=0
for i in range(q):	
	for j in range(n):
		if T[i]==S[j]:
			point+=1
			break		
print(point)


Fixed submission:
#16D8101014F 久留米 竜之介 2018/5/14
n=int(input())
S=list(map(int,input().split()))
q=int(input())
T=list(map(int,input().split()))
point=0
for i in T:
	left=0
	right=n
	while left < right:
		mid=int((left+right)/2)
		if S[mid] == i:
			point += 1
			break
		elif i < S[mid]:
			right = mid
		else:
			left = mid + 1
	#print(i,point)

print(point)

Buggy python submission (verdict: Runtime Error):
#16D8101014F 久留米 竜之介 2018/5/14
n=int(input())
S=list(map(int.input().split()))
q=int(input())
T=list(map(int,input().split()))
point=0
#print(S)
#print(T)

for i in T:
	left=0
	right=n
	while left < right:
		mid=int((left+right)/2)
		if S[mid] == i:
			point += 1
			break
		elif i < S[mid]:
			right = mid
		else:
			left = mid + 1
	#print(i,point)

print(point)


Fixed submission:
#16D8101014F 久留米 竜之介 2018/5/14
n=int(input())
S=list(map(int,input().split()))
q=int(input())
T=list(map(int,input().split()))
point=0
for i in T:
	left=0
	right=n
	while left < right:
		mid=int((left+right)/2)
		if S[mid] == i:
			point += 1
			break
		elif i < S[mid]:
			right = mid
		else:
			left = mid + 1
	#print(i,point)

print(point)
Buggy python submission (verdict: Runtime Error):
#16D8101014F Kurume Ryunosuke 久留米竜之介 2018/5/16 Python3
n = int(input())
box = set()

for _ in range(n):
    tmp,mozi= input().split()
    
    if tmp == "find":
        if word in box:
            print("yes")
        else:
            print("no")
    else:
        dic.add(mozi)



Fixed submission:
#16D8101014F Kurume Ryunosuke 久留米竜之介 2018/5/16 Python3
n = int(input())
box = set()

for _ in range(n):
    tmp,mozi= input().split()
    
    if tmp == "find":
        if mozi in box:
            print("yes")
        else:
            print("no")
    else:
        box.add(mozi)

Buggy python submission (verdict: Runtime Error):
#16D8101014F Kurume Ryunosuke 久留米竜之介 2018/5/16 Python3
n = int(input())
box = set()

for i in range(n):
    tmp,mozi= input().split()
    
    if tmp == "find":
        if word in box:
            print("yes")
        else:
            print("no")
    else:
        dic.add(mozi)



Fixed submission:
#16D8101014F Kurume Ryunosuke 久留米竜之介 2018/5/16 Python3
n = int(input())
box = set()

for _ in range(n):
    tmp,mozi= input().split()
    
    if tmp == "find":
        if mozi in box:
            print("yes")
        else:
            print("no")
    else:
        box.add(mozi)

Buggy python submission (verdict: Runtime Error):
#16D8101014F Kurume Ryunosuke 久留米竜之介 2018/5/16 Python3
n = int(input())
box = set()

for _ in range(n):
    tmp,mozi= input().split()
    
    if tmp == "find":
        if word in box:
            print("yes")
        else:
            print("no")
    else:
        box.add(mozi)


Fixed submission:
#16D8101014F Kurume Ryunosuke 久留米竜之介 2018/5/16 Python3
n = int(input())
box = set()

for _ in range(n):
    tmp,mozi= input().split()
    
    if tmp == "find":
        if mozi in box:
            print("yes")
        else:
            print("no")
    else:
        box.add(mozi)

Buggy python submission (verdict: Runtime Error):
#16D8101014F Kurume Ryunosuke 久留米竜之介 2018/5/16 Python3
n = int(input())
box = set()

for i in range(n):
    tmp,mozi= input().split()
    
    if tmp == "find":
        if word in box:
            print("yes")
        else:
            print("no")
    else:
        box.add(mozi)


Fixed submission:
#16D8101014F Kurume Ryunosuke 久留米竜之介 2018/5/16 Python3
n = int(input())
box = set()

for _ in range(n):
    tmp,mozi= input().split()
    
    if tmp == "find":
        if mozi in box:
            print("yes")
        else:
            print("no")
    else:
        box.add(mozi)
Buggy python submission (verdict: Runtime Error):
n=int (input())
A=list(map(int,input().split()))
q=int (input())
m=list(map(int,input().split()))

box=[]
for i in range(2**n):
	b = '{0:0{1}b}'.format(i,n)
	tmp=[]
	for j in rangee(n):
		if b[j]=='1':
			if b[j]=='1':
				tmp.append(A[j])
	sum_list.append(box(tmp))
	
for k in m:
	if k in box:
		print("yes")
	else:
		print("no")


Fixed submission:
n=int (input())
A=list(map(int,input().split()))
q=int (input())
m=list(map(int,input().split()))

box=[]
for i in range(2**n):
	b = '{0:0{1}b}'.format(i,n)
	tmp=[]
	for j in range(n):
		if b[j]=='1':
			if b[j]=='1':
				tmp.append(A[j])
	box.append(sum(tmp))
	
for k in m:
	if k in box:
		print("yes")
	else:
		print("no")
Buggy python submission (verdict: Runtime Error):
a=int(input(""))
b=int(input(""))

p=(a+b)*2
Area=a*b

print(p,Area)



Fixed submission:
a,b=map(int,input().split())
p=(a+b)*2
Area=a*b
print(Area,p)

Buggy python submission (verdict: Runtime Error):
a=int(input(""))
b=int(input(""))

p=(a+b)*2
Area=a*b

print(p,Area)



Fixed submission:
a,b=map(int,input().split())
p=(a+b)*2
Area=a*b
print(Area,p)

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())

p=(a+b)*2
Area=a*b

print(p,Area)



Fixed submission:
a,b=map(int,input().split())
p=(a+b)*2
Area=a*b
print(Area,p)

Buggy python submission (verdict: Runtime Error):
#
a=int(input())
b=int(input())

p=(a+b)*2
Area=a*b

print(Area,p)



Fixed submission:
a,b=map(int,input().split())
p=(a+b)*2
Area=a*b
print(Area,p)

Buggy python submission (verdict: Runtime Error):
#
line=(input())
line.split()

a=int(line[0])
b=int(line[2])

p=(a+b)*2
Area=a*b

print(Area,p)



Fixed submission:
a,b=map(int,input().split())
p=(a+b)*2
Area=a*b
print(Area,p)

Buggy python submission (verdict: Runtime Error):
line=(input())
line.split()
a=int(line[0])
b=int(line[2])
p=(a+b)*2
Area=a*b
print(Area,p)



Fixed submission:
a,b=map(int,input().split())
p=(a+b)*2
Area=a*b
print(Area,p)
Buggy python submission (verdict: Runtime Error):
while 1:
    s1 = input().split('\"')
    if s1[0] == '.': break
    s2 = input().split('\"')

    jdg = 1
    cnt_d = 

    if len(s1) != len(s2): print("DIFFERENT")
    else:
        l = len(s1)
        i = 0
        while i < l:
            if s1[i] != s2[i]:
                cnt_d += 1
                if cnt_d == 1 and i % 2 == 1:
                    jdg = 1
                else:
                    jdg = 0
                    break
            i += 1

        if jdg == 1 and cnt_d == 1: print("CLOSE")
        elif jdg == 0 or cnt_d > 1: print("DIFFERENT")
        else: print("IDENTICAL")



Fixed submission:
while 1:
    s1 = input().split('\"')
    if s1[0] == '.': break
    s2 = input().split('\"')

    jdg = 1
    cnt_d = 0

    if len(s1) != len(s2): print("DIFFERENT")
    else:
        l = len(s1)
        i = 0
        while i < l:
            if s1[i] != s2[i]:
                cnt_d += 1
                if cnt_d == 1 and i % 2 == 1:
                    jdg = 1
                else:
                    jdg = 0
                    break
            i += 1

        if jdg == 1 and cnt_d == 1: print("CLOSE")
        elif jdg == 0 or cnt_d > 1: print("DIFFERENT")
        else: print("IDENTICAL")
Buggy python submission (verdict: Runtime Error):
n = int(input())
A = map(int, input().split())

for i in range(1, n):
    v = A[i]
    j = i - 1
    while j >= 0 and A[j] > v:
        A[j+1] = A[j]
        j -= 1
    A[j+1] = v
    print(A)


Fixed submission:
def insertionsort(A, n):
    for i in range(1, n):
        v = A[i]
        j = i - 1
        while j >= 0 and A[j] > v:
            A[j+1] = A[j]
            j -= 1
        A[j+1] = v
        prt(A)

def prt(A):
    for i in A:
        if i != A[len(A)-1]: print(i, end=" ")
        else: print(i)

n = int(input())
A = input().split()
A = [int(i) for i in A]
prt(A)
insertionsort(A, n)

Buggy python submission (verdict: Runtime Error):
def insertionsort(A, n):
    for i in range(1, n):
        v = A[i]
        j = i - 1
        while j >= 0 and A[j] > v:
            A[j+1] = A[j]
            j -= 1
        A[j+1] = v
        prt(A)

def prt(A):
    for i in A:
        if i != A[len(A)-1]: print(i, end=" ")
        else print(i)

n = int(input())
A = input().split()
A = [int(i) for i in A]
prt(A)
insertionsort(A, n)


Fixed submission:
def insertionsort(A, n):
    for i in range(1, n):
        v = A[i]
        j = i - 1
        while j >= 0 and A[j] > v:
            A[j+1] = A[j]
            j -= 1
        A[j+1] = v
        prt(A)

def prt(A):
    for i in A:
        if i != A[len(A)-1]: print(i, end=" ")
        else: print(i)

n = int(input())
A = input().split()
A = [int(i) for i in A]
prt(A)
insertionsort(A, n)
Buggy python submission (verdict: Runtime Error):
n = float(input())
A = []

for i in range(n): A.append(float(input()))

B = A[:-1]
mini = min(B)
min_idx = B.index(mini)
C = A[min_idx+1:]
maxi = max(C)

print(maxi - mini)


Fixed submission:
n = int(input())
R = []

for i in range(n): R.append(int(input()))

maxv = R[1] - R[0]
minv = R[0]
for j in range(1, n):
    maxv = max(maxv, R[j]-minv)
    minv = min(minv, R[j])

print(maxv)
Buggy python submission (verdict: Runtime Error):
A = input().split()
S = []


for i in A:
    if i == '+' or i == '-' or i == '*':
        a = pop()
        b = pop()
        if i == '+': S.append(a+b)
        elif i == '-': S.append(a-b)
        else: S.append(a*b)
    else:
        x = int(i)
        S.append(x)

print(S[0])



Fixed submission:
A = input().split()
S = []


for i in A:
    if i == '+' or i == '-' or i == '*':
        a = S.pop()
        b = S.pop()
        if i == '+': S.append(b+a)
        elif i == '-': S.append(b-a)
        else: S.append(b*a)
    else:
        x = int(i)
        S.append(x)
    #print(S)

print(S[0])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
S = list(map(int, input().split()))

n = int(input())
T = list(map(int, input().split()))
cnt = 0

for i in T:
    left = 0
    right = len(S)-1
    center = int( (left+right) / 2 )

    while center >= left and center <= right:
        if S[center] == i:
            cnt += 1
            break
        elif S[center] > i:
            right = center-1
            center = int( (left+right) / 2 )
        elif S[center] < i:
            left = center-1
            center = int( (left+right) / 2 )

print(cnt)


Fixed submission:
n = int(input())
S = list(map(int, input().split()))

n = int(input())
T = list(map(int, input().split()))
cnt = 0

for i in T:
    left = 0
    right = len(S)-1
    center = int( (left+right) / 2 )

    while center >= left and center <= right:
        if S[center] == i:
            cnt += 1
            break
        elif S[center] > i:
            right = center-1
            center = int( (left+right) / 2 )
        elif S[center] < i:
            left = center+1
            center = int( (left+right) / 2 )

print(cnt)
Buggy python submission (verdict: Runtime Error):
s = input()
a = int(s[0])
b = int(s[2])

print(a*b, 2*(a+b))


Fixed submission:
a,b = map(int, input().split())
print(a*b, 2*(a+b))

Buggy python submission (verdict: Runtime Error):
s = input()
a = int(s[0])
b = int(s[2])

print(a*b, 2*(a+b))


Fixed submission:
a,b = map(int, input().split())
print(a*b, 2*(a+b))
Buggy python submission (verdict: Runtime Error):
maxs=[]
while(True):
    max=0
    
    b=list(map(int,input().split()))
    n=b[0]
    m=b[1]
    if(n == 0 and m == 0):
        break
    a=list(map(int,input().split()))
    for i in range(n):
        for j in range(i+1,n):
            sum=a[i]+a[j]
            if(sum>max and sum<m):
                max=sum
    
    maxs.append(max)
for i in maxs:
    if maxs[i]==0:
        print("NONE")
    else:
        print(maxs[i])




Fixed submission:
maxs=[]
while(True):
    max=-1
    
    b=list(map(int,input().split()))
    n=b[0]
    m=b[1]
    if(n == 0 and m == 0):
        break
    a=list(map(int,input().split()))
    for i in range(n):
        for j in range(i+1,n):
            sum=a[i]+a[j]
            if(sum>max and sum<=m):
                max=sum
    maxs.append(max)

for i in maxs:
    if i==-1:
        print("NONE")
    else:
        print(i)

Buggy python submission (verdict: Runtime Error):
maxs=[]
while(True):
    max=-1
    
    b=list(map(int,input().split()))
    n=b[0]
    m=b[1]
    if(n == 0 and m == 0):
        break
    a=list(map(int,input().split()))
    for i in range(n):
        for j in range(i+1,n):
            sum=a[i]+a[j]
            if(sum>max and sum=<m):
                max=sum
    maxs.append(max)

for i in maxs:
    if i==-1:
        print("NONE")
    else:
        print(i)



Fixed submission:
maxs=[]
while(True):
    max=-1
    
    b=list(map(int,input().split()))
    n=b[0]
    m=b[1]
    if(n == 0 and m == 0):
        break
    a=list(map(int,input().split()))
    for i in range(n):
        for j in range(i+1,n):
            sum=a[i]+a[j]
            if(sum>max and sum<=m):
                max=sum
    maxs.append(max)

for i in maxs:
    if i==-1:
        print("NONE")
    else:
        print(i)
Buggy python submission (verdict: Runtime Error):

def Dictionary(b):
    a=list(map(int,input().split()))
    if(a[0] == "insert"):
        b.append(a[1])
    elif(a[0] == "find"):
        if(a[1] in b):
            print("yes")
        else:
            print("no")

if __name__ == "__main__":
    n=int(input())
    b=[]
    for i in range(n):
        Dictionary(b)
    
            


Fixed submission:
import sys
d={}
input()
for i in sys.stdin:
    if i[0] == "i":
        d[i[7:]]=0
    else:
        if i[5:] in d:
            print("yes")
        else:
            print("no")

Buggy python submission (verdict: Time Limit Exceeded):

def Dictionary(b):
    a=list(input().split())
    if(a[0] == "insert"):
        b.append(a[1])
    elif(a[0] == "find"):
        if(a[1] in b):
            print("yes")
        else:
            print("no")

if __name__ == "__main__":
    n=int(input())
    b=[]
    for i in range(n):
        Dictionary(b)
    
            
                


Fixed submission:
import sys
d={}
input()
for i in sys.stdin:
    if i[0] == "i":
        d[i[7:]]=0
    else:
        if i[5:] in d:
            print("yes")
        else:
            print("no")
Buggy python submission (verdict: Runtime Error):
import math
from matplotlib import pyplot
class Dot:
    x=0.0
    y=0.0
    def __init__(self,x,y):
        self.x=x
        self.y=y
    def __lt__(self,other):
        return self.x < other.x
    def print(self):
        x=self.x
        y=self.y
        print("{:.8f} {:.8f}".format(x,y))       
def kock(n,a,b,dots):
    if n == 0:
        return
    s=Dot((2*a.x+b.x)/3,(2*a.y+b.y)/3)
    t=Dot((a.x+2*b.x)/3,(a.y+2*b.y)/3)
    rad=math.radians(60)
    x=(t.x-s.x)*math.cos(rad)-(t.y-s.y)*math.sin(rad)+s.x
    y=(t.x-s.x)*math.sin(rad)+(t.y-s.y)*math.cos(rad)+s.y
    u=Dot(x,y)

    kock(n-1,a,s,dots)
    s.print()
    dots.append(s)
    kock(n-1,s,u,dots)
    u.print()
    dots.append(u)
    kock(n-1,u,t,dots)
    t.print()
    dots.append(t)
    kock(n-1,t,b,dots)

if __name__ == "__main__":
    n=int(input())
    dots=[]
    dot1=Dot(0,0)
    dot2=Dot(100,0)
    dots.append(dot1)
    dots.append(dot2)
    dot1.print()
    kock(n,dot1,dot2,dots)
    dot2.print()


Fixed submission:
import math
class Dot:
    x=0.0
    y=0.0
    def __init__(self,x,y):
        self.x=x
        self.y=y
    def __lt__(self,other):
        return self.x < other.x
    def print(self):
        x=self.x
        y=self.y
        print("{:.8f} {:.8f}".format(x,y))       
def kock(n,a,b,dots):
    if n == 0:
        return
    s=Dot((2*a.x+b.x)/3,(2*a.y+b.y)/3)
    t=Dot((a.x+2*b.x)/3,(a.y+2*b.y)/3)
    rad=math.radians(60)
    x=(t.x-s.x)*math.cos(rad)-(t.y-s.y)*math.sin(rad)+s.x
    y=(t.x-s.x)*math.sin(rad)+(t.y-s.y)*math.cos(rad)+s.y
    u=Dot(x,y)

    kock(n-1,a,s,dots)
    s.print()
    dots.append(s)
    kock(n-1,s,u,dots)
    u.print()
    dots.append(u)
    kock(n-1,u,t,dots)
    t.print()
    dots.append(t)
    kock(n-1,t,b,dots)

if __name__ == "__main__":
    n=int(input())
    dots=[]
    dot1=Dot(0,0)
    dot2=Dot(100,0)
    dots.append(dot1)
    dots.append(dot2)
    dot1.print()
    kock(n,dot1,dot2,dots)
    dot2.print()
Buggy python submission (verdict: Runtime Error):
#16D8101012J 伊藤惇 dj Python3 

def area(a,b):
    c=a*b
    return c

def perimeter_of_the_rectangle(a,b):
    c=(a+b)*2
    return c

def Rectangle():
    a=int(input("input_a:"))
    b=int(input("input_b:"))
    c=area(a,b)
    d=perimeter_of_the_rectangle(a,b)
    print("{} {}".format(c,d))

if __name__ == '__main__':
    Rectangle()

"""
perimeter

"""


Fixed submission:
def area(a,b):
    c=a*b
    return c
def perimeter_of_the_rectangle(a,b):
    c=(a+b)*2
    return c
def Rectangle():
    a,b=map(int,input().split())
    c=area(a,b)
    d=perimeter_of_the_rectangle(a,b)
    print("{} {}".format(c,d))
    
if __name__ == '__main__':
    Rectangle()

Buggy python submission (verdict: Runtime Error):
#16D8101012J 伊藤惇 dj Python3 

def area(a,b):
    c=a*b
    return c

def perimeter_of_the_rectangle(a,b):
    c=(a+b)*2
    return c

def Rectangle():
    a=int(input("input_a:"))
    b=int(input("input_b:"))
    c=area(a,b)
    d=perimeter_of_the_rectangle(a,b)
    print("{} {}".format(c,d))

if __name__ == '__main__':
    Rectangle()


Fixed submission:
def area(a,b):
    c=a*b
    return c
def perimeter_of_the_rectangle(a,b):
    c=(a+b)*2
    return c
def Rectangle():
    a,b=map(int,input().split())
    c=area(a,b)
    d=perimeter_of_the_rectangle(a,b)
    print("{} {}".format(c,d))
    
if __name__ == '__main__':
    Rectangle()

Buggy python submission (verdict: Runtime Error):
#16D8101012J 伊藤惇 dj Python3 

def area(a,b):
    c=a*b
    return c

def perimeter_of_the_rectangle(a,b):
    c=(a+b)*2
    return c

def Rectangle():
    a=int(input("input_a:"))
    b=int(input("input_b:"))
    c=area(a,b)
    d=perimeter_of_the_rectangle(a,b)
    print("{} {}".format(c,d),end="")

if __name__ == '__main__':
    Rectangle()

"""
perimeter

"""


Fixed submission:
def area(a,b):
    c=a*b
    return c
def perimeter_of_the_rectangle(a,b):
    c=(a+b)*2
    return c
def Rectangle():
    a,b=map(int,input().split())
    c=area(a,b)
    d=perimeter_of_the_rectangle(a,b)
    print("{} {}".format(c,d))
    
if __name__ == '__main__':
    Rectangle()
Buggy python submission (verdict: Time Limit Exceeded):
import math
n=int(input())
a=[]
c=0.0
for i in range(n):
  a.append(input())
cnt=0
b=[int(i) for i in a]
for i in range(n):
    if b[i]==2:
      cnt+=1
    for j in range(2,b[i]):
      if b[i]%j==0:
        break
      if b[i]-j==1:
        cnt+=1
print(cnt)       
      


Fixed submission:
import math
n=int(input())
a=[]

for i in range(n):
  a.append(input())
cnt=0
b=[int(i) for i in a]

for i in range(n):
    c=math.sqrt(b[i])
    c=int(c)
    if b[i]==2:
      cnt+=1
    for j in range(2,b[i]):
      if b[i]%j==0:
        break
      if math.sqrt(b[i])<j:
        cnt+=1
        break
print(cnt)
Buggy python submission (verdict: Runtime Error):
a=float(input())
b=float(input())
print(a*b," ",2*a+2*b)


Fixed submission:
a=input().split()
b=[int(i) for i in a]
print(b[0]*b[1],2*(b[0]+b[1]))

Buggy python submission (verdict: Runtime Error):
a=float(input)
b=float(input)
print(a*b," ",2*a+2*b)


Fixed submission:
a=input().split()
b=[int(i) for i in a]
print(b[0]*b[1],2*(b[0]+b[1]))

Buggy python submission (verdict: Runtime Error):
a=float(input())
b=float(input())
print(a*b," ",2*(a+b))


Fixed submission:
a=input().split()
b=[int(i) for i in a]
print(b[0]*b[1],2*(b[0]+b[1]))

Buggy python submission (verdict: Runtime Error):
a=float(input())
b=float(input())
print(a*b," ",2*(a+b))


Fixed submission:
a=input().split()
b=[int(i) for i in a]
print(b[0]*b[1],2*(b[0]+b[1]))
Buggy python submission (verdict: Runtime Error):
#coding: Shift_JIS
import numpy as np

def set_array(a,n):
	str=input()
	array=str.split()
	for i in range(n):
		a[i]=int(array[i])
	

n=int(input())
S=np.zeros(n)
set_array(S,n)
q=int(input())
T=np.zeros(q)
set_array(T,q)
C=0

def linear_search(S,x):
	np.append(S,x)
	len=np.size(S)
	i=0
	while(len>i):
		if S[i]==x: break;
		i=i+1
	
	np.delete(S,-1)
	if i!=len:
		return 1;
	else:
		return 0;

for v in T:
	C+=linear_search(S,v)

print(C)


Fixed submission:
#coding: Shift_JIS

def set_array(a,n):
	str=input()
	array=str.split()
	for i in range(n):
		a.append(int(array[i]))
	

n=int(input())
S=[]
set_array(S,n)
q=int(input())
T=[]
set_array(T,q)
C=0

def linear_search(S,x):
	S.append(x)
	l=len(S)
	i=0
	while(l>i):
		if S[i]==x:
			break
		i=i+1
	S.pop(-1)
	if i!=l-1:
		return 1;
	else:
		return 0;
for v in T:
	C+=linear_search(S,v)

print(C)

Buggy python submission (verdict: Runtime Error):
#coding: Shift_JIS
import numpy as np

def set_array(a,n):
	str=input()
	array=str.split()
	for i in range(n):
		a[i]=int(array[i])
	

n=int(input())
S=np.zeros(n)
set_array(S,n)
q=int(input())
T=np.zeros(q)
set_array(T,q)
C=0

def linear_search(S,x):
	np.append(S,x)
	len=np.size(S)
	i=0
	while(len>i):
		if S[i]==x: break;
		i=i+1
	
	np.delete(S,-1)
	if i!=len:
		return 1;
	else:
		return 0;

for v in T:
	C+=linear_search(S,v)

print(C)


Fixed submission:
#coding: Shift_JIS

def set_array(a,n):
	str=input()
	array=str.split()
	for i in range(n):
		a.append(int(array[i]))
	

n=int(input())
S=[]
set_array(S,n)
q=int(input())
T=[]
set_array(T,q)
C=0

def linear_search(S,x):
	S.append(x)
	l=len(S)
	i=0
	while(l>i):
		if S[i]==x:
			break
		i=i+1
	S.pop(-1)
	if i!=l-1:
		return 1;
	else:
		return 0;
for v in T:
	C+=linear_search(S,v)

print(C)