Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import re

white = re.compile('(1*)$')
black = re.compile('(0*)$')

while True:

    n = int(raw_input())

    if n == 0:
        break

    s = ''
    for i in xrange(n):
        if (i + 1) % 2 != 0:
            s += raw_input()

        else:
            p = raw_input()
            if p == '0':
                m = white.search(s)
                s = white.sub('0' * len(m.group(1)), s)
                s += '0'
            else:
                m = black.search(s)
                s = black.sub('1' * len(m.group(1)), s)
                s += '1'
    print s.count('0')

Fixed submission:
while True:
    n = int(raw_input())
    if n == 0:
        break
    li = []

    for i in xrange(n):
        p = int(raw_input())
        if i == 0:
            li.append([p, 1])
            continue
        # odd
        if i % 2 == 0:
            if li[-1][0] == p:
                li[-1][1] += 1
            else:
                li.append([p, 1])
        else:
            if li[-1][0] == p:
                li[-1][1] += 1
            else:
                li[-1][0] = p
                li[-1][1] += 1
                if len(li) >= 2 and li[-2][0] == li[-1][0]:
                    li[-2][1] += li[-1][1]
                    del li[-1]

    print sum(t[1] for t in li if t[0] == 0)
Buggy python submission (verdict: Runtime Error):
a,b = map(int, raw_input())
print a/b, a%b, float(a)/b

Fixed submission:
a,b = map(int, raw_input().split())
print "%d %d %.5f" % (a/b, a%b, float(a)/b)
Buggy python submission (verdict: Runtime Error):
from math import pi

x = int(raw_input())
print '%.6f %.6f' % (pi * x * x, pi * 2 * x)

Fixed submission:
from math import pi

x = float(raw_input())
print '%.6f %.6f' % (pi * x * x, pi * 2 * x)
Buggy python submission (verdict: Runtime Error):
import sys

lst = []
for line in sys.stdin:
    num = int(line)
    if num == 0:
        print lst.pop()
    else:
        lst.append(num)

Fixed submission:
import sys

lst = []
for line in sys.stdin:
    if line.strip() :
        num = int(line.strip())
        if num == 0:
            print lst.pop()
        else:
            lst.append(num)

Buggy python submission (verdict: Runtime Error):
import sys

lst = []
for line in sys.stdin:
    num = int(line)
    if num == 0:
        print lst.pop()
    else:
        lst.append(num)

Fixed submission:
import sys

lst = []
for line in sys.stdin:
    if line.strip() :
        num = int(line.strip())
        if num == 0:
            print lst.pop()
        else:
            lst.append(num)

Buggy python submission (verdict: Runtime Error):
import sys

lst = []
for line in sys.stdin:
    num = int(line.split())
    if num == 0:
        print lst.pop()
    else:
        lst.append(num)
sys.exit(0)

Fixed submission:
import sys

lst = []
for line in sys.stdin:
    if line.strip() :
        num = int(line.strip())
        if num == 0:
            print lst.pop()
        else:
            lst.append(num)

Buggy python submission (verdict: Runtime Error):
import sys

lst = []
for line in sys.stdin:
    num = int(line.strip())
    if num == 0:
        print lst.pop()
    else:
        lst.append(num)

Fixed submission:
import sys

lst = []
for line in sys.stdin:
    if line.strip() :
        num = int(line.strip())
        if num == 0:
            print lst.pop()
        else:
            lst.append(num)
Buggy python submission (verdict: Runtime Error):
a = int(input())
PI = 3.1415926535
print("%f %f" % (a*a*PI, a*PI*2))

Fixed submission:
a = float(input())
PI = 3.14159265358979323846
print("%f %f" % (a*a*PI, a*PI*2))
Buggy python submission (verdict: Runtime Error):
import sys;print"\n".join("%d %d"%(lambda l:(l[0],l[2]/l[0]*l[1]))(lambda f,l:(f(f,l),l[0],l[1]))(lambda f,l:l[1]==0 and l[0] or f(f,[l[1],l[0]%l[1]]),map(int,s.split()))for s in sys.stdin)

Fixed submission:
import sys;print"\n".join("%d %d"%(lambda l:(l[0],l[2]/l[0]*l[1]))((lambda f,l:(f(f,l),l[0],l[1]))(lambda f,l:l[1]==0 and l[0] or f(f,[l[1],l[0]%l[1]]),map(int,s.split())))for s in sys.stdin)
Buggy python submission (verdict: Runtime Error):
while 1:
    n = int(raw_input())
    cnt = 0;
    for i in range(0, 10):
        for j in range(0, 10):
            for k in range(0, 10):
                for l in range(0, 10):
                    if n == i+j+k+l: cnt+=1
    print cnt

Fixed submission:
while True:
    try:
        n = int(raw_input())
        
        cnt = 0;
        for i in range(0, 10):
            for j in range(0, 10):
                for k in range(0, 10):
                    for l in range(0, 10):
                        if n == i+j+k+l: cnt+=1
        print cnt

    except EOFError:
        break
Buggy python submission (verdict: Runtime Error):
l=[]
while True:
    s = raw_input()
    if s=="":
        break
    l.append(s)
l.sort()
l.reverse()
for i in range(3):
    print l.pop(0)

Fixed submission:
l=[]
while True:
    try:
        l.append(input())
    except EOFError:
        break
l.sort(reverse = True)
for i in range(3):
    print l[i]

Buggy python submission (verdict: Runtime Error):
l=[]
while True:
    try:
        l.append(input())
    except SyntaxError:
        break
l.sort(reverse = True)
for i in range(3):
    print l[i]

Fixed submission:
l=[]
while True:
    try:
        l.append(input())
    except EOFError:
        break
l.sort(reverse = True)
for i in range(3):
    print l[i]
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split(" "))
print(a*b,2*(a+b))

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

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
print(a*b,2*a+2*b)

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

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
print a*b, 2*a+2*b

Fixed submission:
a,b=map(int,raw_input().split())
print a*b, 2*a+2*b
Buggy python submission (verdict: Runtime Error):
while True:
    l = map(int,raw_input())
    if l==[0,0]:
        break
    l.sort()
    print " ".join(l)

Fixed submission:
while True:
    l = map(int,raw_input().split())
    if l==[0,0]:
        break
    l.sort()
    s = [str(x) for x in l]
    print " ".join(s)
Buggy python submission (verdict: Runtime Error):
for i in range(1:10):
    for j in range(1,10):
        print(i,"x",j,"=",i*j)

Fixed submission:
for i in range(1,10):
    for j in range(1,10):
        print(i,"x",j,"=",i*j,sep="")
Buggy python submission (verdict: Runtime Error):
for line in sys.stdin:
    a, b = map(int, line.split())
    print(int(math.log(a + b, 10)//1 + 1))

Fixed submission:
import sys
import math

for line in sys.stdin:
    a, b = map(int, line.split())
    print(int(math.log10(a + b) + 1))
Buggy python submission (verdict: Runtime Error):
n = int(input())

for i in range(n):
    l = list(map(int, line.split()))
    l.sort()
    if l[0]**2 + l[1]**2 == l[3]**2: print("YES")
    else: print("NO")

Fixed submission:
n = int(input())

for i in range(n):
    l = list(map(int, input().split()))
    l.sort()
    if l[0]**2 + l[1]**2 == l[2]**2: print("YES")
    else: print("NO")
Buggy python submission (verdict: Time Limit Exceeded):
import math

while True:
    try:
        c = 0
        n = int(input())
        for i in range(n,1,-1):
            if i == 2:
                c += 1
                break
            elif i%2 == 0:
                continue
            else:
                j = 3
                while j <= math.sqrt(i):
                    if i%j == 0:
                        break
                    j += 2
                else:
                    c += 1
        print(c)
    except:
        break

Fixed submission:
n = 999999
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
    j = i*2
    while j <= n:
        c[j - 1] = 0
        j += i
    i += 1

while True:
    try:
        n = int(input())
        print(sum(c[:n]))
    except:
        break

Buggy python submission (verdict: Time Limit Exceeded):
import math

while True:
    try:
        n = int(input())
        c = [1 for i in range(n)]
        c[0] = 0
        i = 2
        while i**2 <= n:
            j = i*2
            while j <= n:
                c[j - 1] = 0
                j += i
            i += 1
        print(sum(c))
    except:
        break

Fixed submission:
n = 999999
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
    j = i*2
    while j <= n:
        c[j - 1] = 0
        j += i
    i += 1

while True:
    try:
        n = int(input())
        print(sum(c[:n]))
    except:
        break
Buggy python submission (verdict: Runtime Error):
import numpy

while True:
    try:
        x1, y1, x2, y2, x3, y3, xp, yp = map(float, input().split())
        s1 = (x2-x1)*(yp-y1) - (y2-y1)*(xp-x1)
        s2 = (x3-x2)*(yp-y2) - (y3-y2)*(xp-x2)
        s3 = (x1-x3)*(yp-y3) - (y1-y3)*(xp-x3)
        if numpy.sign(s1) == numpy.sign(s2) and numpy.sign(s1) == numpy.sign(s3):
            print("YES")
        else:
            print("NO")
    except:
        break



Fixed submission:
import math

while True:
    try:
        x1, y1, x2, y2, x3, y3, xp, yp = map(float, input().split())
        s1 = (x2-x1)*(yp-y1) - (y2-y1)*(xp-x1)
        s2 = (x3-x2)*(yp-y2) - (y3-y2)*(xp-x2)
        s3 = (x1-x3)*(yp-y3) - (y1-y3)*(xp-x3)
        if math.copysign(1, s1) == math.copysign(1, s2) and math.copysign(1, s1) == math.copysign(1, s3):
            print("YES")
        else:
            print("NO")
    except:
        break

Buggy python submission (verdict: Runtime Error):
import numpy

while True:
    try:
        x1, y1, x2, y2, x3, y3, xp, yp = map(float, input().split())
        s1 = (x2-x1)*(yp-y1) - (y2-y1)*(xp-x1)
        s2 = (x3-x2)*(yp-y2) - (y3-y2)*(xp-x2)
        s3 = (x1-x3)*(yp-y3) - (y1-y3)*(xp-x3)
        if numpy.sign(s1) == numpy.sign(s2) and numpy.sign(s1) == numpy.sign(s3):
            print("YES")
        else:
            print("NO")
    except:
        break



Fixed submission:
import math

while True:
    try:
        x1, y1, x2, y2, x3, y3, xp, yp = map(float, input().split())
        s1 = (x2-x1)*(yp-y1) - (y2-y1)*(xp-x1)
        s2 = (x3-x2)*(yp-y2) - (y3-y2)*(xp-x2)
        s3 = (x1-x3)*(yp-y3) - (y1-y3)*(xp-x3)
        if math.copysign(1, s1) == math.copysign(1, s2) and math.copysign(1, s1) == math.copysign(1, s3):
            print("YES")
        else:
            print("NO")
    except:
        break
Buggy python submission (verdict: Runtime Error):
import math

n = int(input())
for i in range(n):
    x = int(input())
    y = int(input())
    if int(math.log10(x + y) + 1) > 80:
        print("overflow")
    else:
        print(x + y)



Fixed submission:
n = int(input())
for i in range(n):
    x = int(input())
    y = int(input())
    if len(str(x + y)) > 80:
        print("overflow")
    else:
        print(x + y)

Buggy python submission (verdict: Runtime Error):
import math
n = int(input())
for i in range(n):
    x = int(input())
    y = int(input())
    if int(math.log10(x + y) + 1) > 80:
        print("overflow")
    else:
        print(x + y)



Fixed submission:
n = int(input())
for i in range(n):
    x = int(input())
    y = int(input())
    if len(str(x + y)) > 80:
        print("overflow")
    else:
        print(x + y)
Buggy python submission (verdict: Time Limit Exceeded):
while True:
    n = int(input())
    if n == 0:
        break
    sum_max = 0
    a = []
    for i in range(n):
        a.append(int(input()))
        for j in range(i + 1):
            sum_tmp = sum(a[j:i + 1])
            if sum_tmp > sum_max:
                sum_max = sum_tmp
    print(sum_max)



Fixed submission:
while True:
    n = int(input())
    if n == 0:
        break
    dp = [int(input())]
    for i in range(1, n):
        a_i = int(input())
        dp.append(max(dp[i - 1] + a_i, a_i))
    print(max(dp))
Buggy python submission (verdict: Time Limit Exceeded):
import itertools

case = 0
while True:
    case += 1
    w_max = int(input())
    if w_max == 0:
        break
    n = int(input())
    t = []
    for i in range(n):
        t.append(list(map(int, input().split(","))))
    v_best = 0
    w_best = 0
    p_all = itertools.product([0,1], repeat=n)
    for p in p_all:
        v = 0
        w = 0
        for i in range(n):
            v += p[i]*t[i][0]
            w += p[i]*t[i][1]
        if v > v_best and w <= w_max:
            v_best = v
            w_best = w
        elif v == v_best and w < w_best:
            v_best = v
            w_best = w
    print("Case ",case,":",sep="")
    print(v_best)
    print(w_best)



Fixed submission:
case = 0
while True:
    case += 1
    w_max = int(input())
    if w_max == 0:
        break
    n = int(input())

    w = [0 for i in range(n)]
    v = [0 for i in range(n)]
    for i in range(n):
        a, b = map(int, input().split(","))
        v[i] = a
        w[i] = b

    dp = [[0 for j in range(w_max + 1)] for i in range(n + 1)]
    for i in range(n)[::-1]:
        for j in range(w_max + 1):
            if j < w[i]:
                dp[i][j] = dp[i + 1][j]
            else:
                dp[i][j] = max(dp[i + 1][j], dp[i + 1][j - w[i]] + v[i])
    print("Case ",case,":",sep="")
    print(max(dp[0]))
    print(dp[0].index(max(dp[0])))
Buggy python submission (verdict: Time Limit Exceeded):
n = 50000
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
    j = i*2
    while j <= n:
        c[j - 1] = 0
        j += i
    i += 1

while True:
    try:
        n = int(input())
        i, a, b = 0, 0, 0
        while a == 0 or b == 0:
            i += 1
            if n - i - 1 >= 0 and a == 0 and c[n - i - 1] == 1:
                a = n - i
            if n + i - 1 < 50000 and b == 0 and c[n + i - 1] == 1:
                b = n + i
        print(a,b)
    except:
        break



Fixed submission:
n = 50021
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
    j = i*2
    while j <= n:
        c[j - 1] = 0
        j += i
    i += 1

while True:
    try:
        n = int(input())
        i, a, b = 0, 0, 0
        while a == 0 or b == 0:
            i += 1
            if n - i - 1 >= 0 and a == 0 and c[n - i - 1] == 1:
                a = n - i
            if n + i - 1 < 50021 and b == 0 and c[n + i - 1] == 1:
                b = n + i
        print(a,b)
    except:
        break
Buggy python submission (verdict: Runtime Error):
d = {"A":1, "B":0, "C":0}
while True:
    try:
        swap1, awap2 = input().split(",")
        d[swap1], d[swap2] = d[swap2], d[swap1]
    except:
        break
print(d.keys()[d.values().index(1)])



Fixed submission:
d = {"A":1, "B":0, "C":0}
while True:
    try:
        swap1, swap2 = input().split(",")
        d[swap1], d[swap2] = d[swap2], d[swap1]
    except:
        break
print(list(d.keys())[list(d.values()).index(1)])
Buggy python submission (verdict: Runtime Error):
import math
n = 7
x = [1 for i in range(n)]
y = [0 for i in range(n)]
ang = 0
for i in range(2, n):
    ang += math.asin(1/math.sqrt(i - 1))
    x[i] = x[i - 1] + math.cos(ang)
    y[i] = y[i - 1] + math.sin(ang)

while True:
    n = int(input())
    if n == -1:
        break
    print(x[n])
    print(y[n])



Fixed submission:
import math
n = 1001
x = [1 for i in range(n)]
y = [0 for i in range(n)]
ang = 0
for i in range(2, n):
    ang += math.asin(1/math.sqrt(i - 1))
    x[i] = x[i - 1] + math.cos(ang)
    y[i] = y[i - 1] + math.sin(ang)

while True:
    n = int(input())
    if n == -1:
        break
    print(x[n])
    print(y[n])

Buggy python submission (verdict: Runtime Error):
import math
n = 7
x = [1 for i in range(n)]
y = [0 for i in range(n)]
ang = 0
for i in range(2, n):
    ang += math.asin(1/math.sqrt(i - 1))
    x[i] = x[i - 1] + math.cos(ang)
    y[i] = y[i - 1] + math.sin(ang)

while True:
    n = int(input())
    if n == -1:
        break
    print(x[n])
    print(y[n])



Fixed submission:
import math
n = 1001
x = [1 for i in range(n)]
y = [0 for i in range(n)]
ang = 0
for i in range(2, n):
    ang += math.asin(1/math.sqrt(i - 1))
    x[i] = x[i - 1] + math.cos(ang)
    y[i] = y[i - 1] + math.sin(ang)

while True:
    n = int(input())
    if n == -1:
        break
    print(x[n])
    print(y[n])
Buggy python submission (verdict: Time Limit Exceeded):
import itertools

while True:
    n, s = map(int, input().split())
    count = 0
    if n == 0:
        break
    for c in itertools.combinations([i for i in range(100)], n):
        if sum(c) == s:
            count += 1
    print(count)



Fixed submission:
ans = [[0 for i in range(1001)] for j in range(11)]
ans[0][0] = 1

for i in range(101):
     for n in range(9, -1, -1):
         for s in range(1001 - i):
             ans[n + 1][s + i] += ans[n][s]

while True:
    n, s = map(int, input().split())
    if n == 0:
        break
    print(ans[n][s])
Buggy python submission (verdict: Runtime Error):
def fibonacci(n)
    if n == 0 or n == 1:
        return 1
    return fibonacci(n - 2) + fibonacci(n - 1)

print(fibonacci(int(input())))

Fixed submission:
def fibonacci(f, n):
    if n == 0 or n == 1:
        f[n] = 1
        return f[n]
    if f[n]:
        return f[n]
    f[n] = fibonacci(f, n - 2) + fibonacci(f, n - 1)
    return f[n]

n = int(input())
f = [None for i in range(n + 1)]
print(fibonacci(f, n))

Buggy python submission (verdict: Time Limit Exceeded):
def fibonacci(n):
    if n == 0 or n == 1:
        return 1
    return fibonacci(n - 2) + fibonacci(n - 1)

print(fibonacci(int(input())))

Fixed submission:
def fibonacci(f, n):
    if n == 0 or n == 1:
        f[n] = 1
        return f[n]
    if f[n]:
        return f[n]
    f[n] = fibonacci(f, n - 2) + fibonacci(f, n - 1)
    return f[n]

n = int(input())
f = [None for i in range(n + 1)]
print(fibonacci(f, n))
Buggy python submission (verdict: Runtime Error):
j = 1
def dfs(graph, start, result, visited=None):
    global j
    if visited == None:
        visited = []
    visited.append(start)
    result[start][1]  = j
    for next in graph[start][2:]:
        if next in visited:
            continue
        j += 1
        dfs(graph, next, result, visited)
    else:
        j += 1
        result[start][2] = j

n = int(input())
g = [[]]
r = [[i,0,0] for i in range(n + 1)]

for i in range(n):
    g.append(list(map(int, input().split())))
dfs(g,1,r)
for i in range(1:n+1)
    print(*r[i])

Fixed submission:
j = 1

def dfs(graph, start, result, visited=None):
    global j
    if visited == None:
        visited = []
    visited.append(start)
    result[start][1]  = j
    for next in graph[start][2:]:
        if next in visited:
            continue
        j += 1
        dfs(graph, next, result, visited)
    else:
        j += 1
        result[start][2] = j

n = int(input())
g = [[]]
r = [[i,0,0] for i in range(n + 1)]
v = []

for i in range(n):
    g.append(list(map(int, input().split())))


for i in range(1, n + 1):
    if i in v:
        continue
    dfs(g,i,r,v)
    j += 1

for i in range(1,n+1):
    print(*r[i])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = []

for i in range(n):
    inp = input()
    if "-1" in inp:
        inp = inp.replace("-1","10000")
    a.append(list(map(int, inp.split())))

w = 0
v = set(range(1,n))

edge    = [ 0, 0]
min_w   = [-1,-1]
min_idx = [-1,-1]

while v:
    min_w[0] = min(a[edge[0]])
    min_w[1] = min(a[edge[1]])
    min_idx[0] = a[edge[0]].index(min_w[0])
    min_idx[1] = a[edge[1]].index(min_w[1])
    if min_w[0] <= min_w[1]:
        k = 0
    else:
        k = 1
    if min_idx[k] not in v:
        a[edge[k]][min_idx[k]] = 10000
        continue
    else:
        w += min_w[k]
        v.remove(min_idx[k])
        edge[k] = min_idx[k]

print(w)

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

for i in range(n):
    inp = input()
    if "-1" in inp:
        inp = inp.replace("-1","10000")
    a.append(list(map(int, inp.split())))

w = 0
v = set()
v.add(0)

while len(v) < n:
    min_w   = 10000
    min_idx = 0
    i = 0
    for node in v:
        if min_w > min(a[node]):
            min_w = min(a[node])
            i = node
            min_idx = a[i].index(min_w)
    if min_idx in v:
        a[i][min_idx] = 10000
        continue
    else:
        w += min_w
        v.add(min_idx)

print(w)

Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
a = []

for i in range(n):
    inp = raw_input()
    if "-1" in inp:
        inp = inp.replace("-1","10000")
    a.append(list(map(int, inp.split())))

w = 0
v = set()
v.add(0)

while len(v) < n:
    min_w   = 10000
    min_idx = 0
    i = 0
    for node in v:
        if min_w > min(a[node]):
            min_w = min(a[node])
            i = node
            min_idx = a[i].index(min_w)
    if min_idx in v:
        a[i][min_idx] = 10000
        continue
    else:
        w += min_w
        v.add(min_idx)

print(w)

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

for i in range(n):
    inp = input()
    if "-1" in inp:
        inp = inp.replace("-1","10000")
    a.append(list(map(int, inp.split())))

w = 0
v = set()
v.add(0)

while len(v) < n:
    min_w   = 10000
    min_idx = 0
    i = 0
    for node in v:
        if min_w > min(a[node]):
            min_w = min(a[node])
            i = node
            min_idx = a[i].index(min_w)
    if min_idx in v:
        a[i][min_idx] = 10000
        continue
    else:
        w += min_w
        v.add(min_idx)

print(w)
Buggy python submission (verdict: Runtime Error):
import math
a = list(map(int,input().split()))
print(math.gcd(a[0],a[1])

Fixed submission:
a = input().split()
x = int(a[0])
y = int(a[1])
while y:
    x, y = y, x%y
print(x)

Buggy python submission (verdict: Runtime Error):
import math
a = list(map(int,input().split()))
print(math.gcd(a[0],a[1]))

Fixed submission:
a = input().split()
x = int(a[0])
y = int(a[1])
while y:
    x, y = y, x%y
print(x)

Buggy python submission (verdict: Runtime Error):
import math
a = list(map(int,input().split()))
print(math.gcd(a[0],a[1]))

Fixed submission:
a = input().split()
x = int(a[0])
y = int(a[1])
while y:
    x, y = y, x%y
print(x)
Buggy python submission (verdict: Runtime Error):
n = int(input())
n_p = 0
for i in range(n):
    a = int(input())
    if a == 2:
        n_p += 1
        continue
    elif a % 2 == 0:
        continue
    else:
        j = 3
        while j =< math.sqrt(a)
            if a%j == 0:
                break
            j += 2
        else:
            n_p += 1
print n_p

Fixed submission:
import math
n = int(input())
n_p = 0
for i in range(n):
    a = int(input())
    if a == 2:
        n_p += 1
        continue
    elif a % 2 == 0:
        continue
    else:
        j = 3
        while j <= math.sqrt(a):
            if a%j == 0:
                break
            j += 2
        else:
            n_p += 1
print(n_p)