Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
def dfs(GF,group,gn,i):
    size = 1
    group[i]=gn
    for node in GF[i]:
        if group[node]==-1:
            group[node]=gn
            size+=dfs(GF,group,gn,node)
    return size

def main():
    from sys import stdin
    n,m,k = map(int,stdin.readline().rstrip().split())
    F=[]
    for _ in range(m):
        F.append(list(map(int,stdin.readline().rstrip().split())))
    GF = [[] for _ in range(n+1)]
    for a,b in F:
        GF[a].append(b)
        GF[b].append(a)
    
    B=[]
    for _ in range(k):
        B.append(list(map(int,stdin.readline().rstrip().split())))
    GB = [[] for _ in range(n+1)]
    for a,b in B:
        GB[a].append(b)
        GB[b].append(a)    

    U = []
    group= [-1]*(n+1)
    gn = 0

    for i in range(1,n+1):
        if group[i] == -1:
            sz = dfs(GF,group,gn,i)
            gn+=1
            U.append(sz)
    
    for i in range(1,n+1):
        g = group[i]
        ans = U[g]-1-len(GF[i])

        for b in GB[i]:
            if group[b]==g:
                ans-=1
        print(ans,end=" ")
main()

Fixed submission:
import sys
sys.setrecursionlimit(10**6)

def dfs(GF,group,gn,i):
    size = 1
    group[i]=gn
    for node in GF[i]:
        if group[node]==-1:
            group[node]=gn
            size+=dfs(GF,group,gn,node)
    return size

def main():
    from sys import stdin
    n,m,k = map(int,stdin.readline().rstrip().split())
    F=[]
    for _ in range(m):
        F.append(list(map(int,stdin.readline().rstrip().split())))
    GF = [[] for _ in range(n+1)]
    for a,b in F:
        GF[a].append(b)
        GF[b].append(a)
    
    B=[]
    for _ in range(k):
        B.append(list(map(int,stdin.readline().rstrip().split())))
    GB = [[] for _ in range(n+1)]
    for a,b in B:
        GB[a].append(b)
        GB[b].append(a)    

    U = []
    group= [-1]*(n+1)
    gn = 0

    for i in range(1,n+1):
        if group[i] == -1:
            sz = dfs(GF,group,gn,i)
            gn+=1
            U.append(sz)
    
    for i in range(1,n+1):
        g = group[i]
        ans = U[g]-1-len(GF[i])

        for b in GB[i]:
            if group[b]==g:
                ans-=1
        print(ans,end=" ")
main()
Buggy python submission (verdict: Runtime Error):
from math import ceil
sys.setrecursionlimit(10**6)
def main():
    INF = 10**9
    h,n = map(int,input().split())
    spell = []
    for _ in range(n):
        spell.append(tuple(map(int,input().split())))

    dp = [[INF]*(h+1) for _ in range(n+1)]

    for i,item in enumerate(spell):
        a,b = item
        for j in range(h):
            if j-a<0:
                dp[i+1][j+1] = min(dp[i][j+1],b*ceil((j+1)/a))
            else:
                dp[i+1][j+1] = min(dp[i][j+1],dp[i+1][j+1-a]+b)
        
    print(dp[n][h])
main()

Fixed submission:
def ceil(x,p):
    if x%p==0:
        return x//p
    else:
        return x//p+1

def main():
    INF = 10**9
    h,n = map(int,input().split())
    spell = []
    for _ in range(n):
        spell.append(tuple(map(int,input().split())))

    dp = [[INF]*(h+1) for _ in range(n+1)]

    for i,item in enumerate(spell):
        a,b = item
        for j in range(h):
            if j-a<0:
                dp[i+1][j+1] = min(dp[i][j+1],b*ceil(j+1,a))
            else:
                dp[i+1][j+1] = min(dp[i][j+1],dp[i+1][j+1-a]+b)
        
    print(dp[n][h])
main()
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    from sys import stdin
    n = int(stdin.readline().rstrip())
    s = list(map(int,list(stdin.readline().rstrip())))
    ans=0
    for i in range(1000):
        tap = (i//100,(i//10)%10,i%10)
        flag = 0
        for p in s:
            if flag == 0:
                if p==tap[0]:
                    flag = 1
            elif flag == 1:
                if p==tap[1]:
                    flag = 2
            elif flag == 2:
                if p==tap[2]:
                    flag = 0
                    ans+=1
                    break
    
    print(ans)
main()

Fixed submission:
def main():
    from sys import stdin
    n = int(stdin.readline().rstrip())
    s = list(map(int,list(stdin.readline().rstrip())))
    ans=0
    g = set(list(range(10))) - set(s)
    for i in range(1000):
        tap = (i//100,(i//10)%10,i%10)
        if set(tap) & g == set({}):
            flag = 0
            for p in s:
                if flag == 0:
                    if p==tap[0]:
                        flag = 1
                elif flag == 1:
                    if p==tap[1]:
                        flag = 2
                elif flag == 2:
                    if p==tap[2]:
                        flag = 0
                        ans+=1
                        break
        else:
            continue

    
    print(ans)
main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    from sys import stdin
    import itertools
    n = int(stdin.readline().rstrip())
    s = str(stdin.readline().rstrip())
    g = set({})

    for key in itertools.combinations(s,3):
        g.add(key)
    
    print(len(g))
main()

Fixed submission:
def main():
    from sys import stdin
    n = int(stdin.readline().rstrip())
    s = list(map(int,list(stdin.readline().rstrip())))
    ans=0
    g = set(list(range(10))) - set(s)
    for i in range(1000):
        tap = (i//100,(i//10)%10,i%10)
        if set(tap) & g == set({}):
            flag = 0
            for p in s:
                if flag == 0:
                    if p==tap[0]:
                        flag = 1
                elif flag == 1:
                    if p==tap[1]:
                        flag = 2
                elif flag == 2:
                    if p==tap[2]:
                        flag = 0
                        ans+=1
                        break
        else:
            continue

    
    print(ans)
main()
Buggy python submission (verdict: Time Limit Exceeded):
def main2():
    n,k = map(int,input().split(" "))
    q = []
    for i in range(n):
        a,b = map(int,input().split(" "))
        q+=[a for j in range(b)]
    
    q.sort()
    print(q[k-1])

main2()

Fixed submission:

def main2():
    import heapq
    n,k = map(int,input().split(" "))
    q = []
    for i in range(n):
        a,b = map(int,input().split(" "))
        heapq.heappush(q,(a,b))
    
    while k>0:
        a,b = heapq.heappop(q)
        k-=b
    
    print(a)
main2()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    import heapq
    n,k = map(int,input().split(" "))
    q = []
    for i in range(n):
        a,b = map(int,input().split(" "))
        for j in range(b):
            heapq.heappush(q,a)
    
    for i in range(k):
        m = heapq.heappop(q)
    
    print(m)
main()

Fixed submission:

def main2():
    import heapq
    n,k = map(int,input().split(" "))
    q = []
    for i in range(n):
        a,b = map(int,input().split(" "))
        heapq.heappush(q,(a,b))
    
    while k>0:
        a,b = heapq.heappop(q)
        k-=b
    
    print(a)
main2()
Buggy python submission (verdict: Time Limit Exceeded):
n,p=map(int,input().split())
ans=1
if(n==1):
    print(p)
    exit()
for i in range(int(pow(p,1/n)+1),0,-1):
    if(p%(pow(i,n))==0):
        ans=i
        break
print(ans)        



Fixed submission:
n,p=map(int,input().split())
root=round(p**(1/n))
for i in range(root,0,-1):
        if(p%(i**n)==0):
                print(i)
                break

Buggy python submission (verdict: Time Limit Exceeded):
n,p=map(int,input().split())
ans=1
if(n==1):
    print(p)
    exit()
for i in range(int(pow(p,1/n)+1),0,-1):
    if(p%(i**n)==0):
        ans=i
        break
print(ans)        



Fixed submission:
n,p=map(int,input().split())
root=round(p**(1/n))
for i in range(root,0,-1):
        if(p%(i**n)==0):
                print(i)
                break

Buggy python submission (verdict: Time Limit Exceeded):
n,p=map(int,input().split())
ans=1
for i in range(int(pow(p,1/n)+1),0,-1):
    if(p%(i**n)==0):
        ans=i
        break
print(ans)        



Fixed submission:
n,p=map(int,input().split())
root=round(p**(1/n))
for i in range(root,0,-1):
        if(p%(i**n)==0):
                print(i)
                break
Buggy python submission (verdict: Runtime Error):
n=int(input())
if n==25:
    print(Christmas)
if n==24:
    print(Christmas Eve)
if n==23:
    print(Christmas Eve Eve)
if n==22:
    print(Christmas Eve Eve Eve)

Fixed submission:
n=int(input())
if n==25:
    print('Christmas')
if n==24:
    print('Christmas Eve')
if n==23:
    print('Christmas Eve Eve')
if n==22:
    print('Christmas Eve Eve Eve')

Buggy python submission (verdict: Runtime Error):
n=int(input())
if n=25:
    print(Christmas)
if n=24:
    print(Christmas Eve)
if n=23:
    print(Christmas Eve Eve)
if n=22:
    print(Christmas Eve Eve Eve)

Fixed submission:
n=int(input())
if n==25:
    print('Christmas')
if n==24:
    print('Christmas Eve')
if n==23:
    print('Christmas Eve Eve')
if n==22:
    print('Christmas Eve Eve Eve')

Buggy python submission (verdict: Runtime Error):
print(Christmas Eve *(25-int(input())

Fixed submission:
n=int(input())
if n==25:
    print('Christmas')
if n==24:
    print('Christmas Eve')
if n==23:
    print('Christmas Eve Eve')
if n==22:
    print('Christmas Eve Eve Eve')
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=[]
for i in range(n)
    p=int(input())
    a.append(p)
a.sort()
a[n-1]=int(a[n-1]/2)
print(sum(a))

Fixed submission:
n=int(input())
a=[]
for i in range(n):
    p=int(input())
    a.append(p)
a.sort()
a[n-1]=int(a[n-1]/2)
print(sum(a))
Buggy python submission (verdict: Runtime Error):
import math
n,m=map(int,input().split())
s=input()
t=input()
c=0
g=math.gcd(n,m)
x=n*m//(math.gcd(n,m))
for k in range(g):
    if s[int(k*n/g)]==t[int(k*m/g)]:
        continue
    else:
        c=-1
        break
       
if c==-1:
    print(c)            
                        
else:
    print(x)
    

Fixed submission:
def gcd(a,b):
    if b:
        return gcd(b,a%b)
    else:
        return a    

n,m=map(int,input().split())
s=input()
t=input()
c=0
g=gcd(n,m)
x=n*m//(gcd(n,m))
for k in range(g):
    if s[int(k*n/g)]==t[int(k*m/g)]:
        continue
    else:
        c=-1
        break
       
if c==-1:
    print(c)            
                        
else:
    print(x)

Buggy python submission (verdict: Runtime Error):
import math
n,m=map(int,input().split())
s=input()
t=input()
c=0
for i in range(m):
    for j in range(n):
        if m*j==n*i:
            if s[j]==t[i]:
                continue
            else:
                c+=1
                break
        else:
            continue
            
if c!=0:
    print(-1)            
                        
else:
    
    print(n*m//(math.gcd(n,m)))
    


Fixed submission:
def gcd(a,b):
    if b:
        return gcd(b,a%b)
    else:
        return a    

n,m=map(int,input().split())
s=input()
t=input()
c=0
g=gcd(n,m)
x=n*m//(gcd(n,m))
for k in range(g):
    if s[int(k*n/g)]==t[int(k*m/g)]:
        continue
    else:
        c=-1
        break
       
if c==-1:
    print(c)            
                        
else:
    print(x)
Buggy python submission (verdict: Runtime Error):
N=int(input())
a=[input() for i in range(N)]
if len(set(a))!=N:
	print("No")
else:
	for i in range(1,N):
		if a[i-1][-1]!=a[i][0]:
			print("No")
			break
		print("yes")		

Fixed submission:
A,B=map(int,input().split())
if A*B%2==0:
	print("No")
else:
	print("Yes")
Buggy python submission (verdict: Runtime Error):
S=input()
if S[0]=="A" and S[2:-1].count("C")==1:
	index=s.index("C")
	S=S[1:index]+S[index+1:]
	if S.islower():
		print("AC")
	else:
		print("WA")	
else:
	print("WA")		

Fixed submission:
S=input()
if S[0]=="A" and S[2:-1].count("C")==1:
	index=S.index("C")
	S=S[1:index]+S[index+1:]
	if S.islower():
		print("AC")
	else:
		print("WA")	
else:
	print("WA")

Buggy python submission (verdict: Runtime Error):
S=input()
char_list=list(S)
if char_list[0]=="A":
	j=0
	del char_list[0]
	for i in range(1,len(char_list)-2):
		if char_list[i]=="C":
			del char_list[i]
			j=j+1
		
	if j==1:
		
		k=0	
		for i in range(0,len(char_list)):	
			if char_list[i].islower():
				k=k+1
			
		if k==len(char_list):
			print("AC")
		else:
			print("WA")			
	else:
		print("WA")		
else:
	print("WA")				
								


Fixed submission:
S=input()
if S[0]=="A" and S[2:-1].count("C")==1:
	index=S.index("C")
	S=S[1:index]+S[index+1:]
	if S.islower():
		print("AC")
	else:
		print("WA")	
else:
	print("WA")
Buggy python submission (verdict: Runtime Error):
N=int(input())
a=list (map(int,input().split()))
abs_list=[]
for b in range(-max(a),max(a)):
	c=0
	for i in range(N):
		c=abs(a[i]-(b+i+1))+c	
	abs_list.append(c)		
print(min(abs_list))	

Fixed submission:
N=int(input())
if N%2==0:
	print(N)
else:
	print	(2*N)

Buggy python submission (verdict: Runtime Error):
N=int(input())
a=list (map(int,input().split()))
abs_list=[]
for b in range(-max(a),max(a)):
	c=0
	for i in range(N):
		c=abs(a[i]-(b+i+1))+c	
	abs_list.append(c)	
print(abs_list)	
print(min(abs_list))	

Fixed submission:
N=int(input())
if N%2==0:
	print(N)
else:
	print	(2*N)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
a=list (map(int,input().split()))
abs_list=[]
for b in range(-max(a),max(a)):
	c=0
	for i in range(N):
		c=abs(a[i]-(b+i+1))+c	
	abs_list.append(c)		
print(min(abs_list))	

Fixed submission:
N=int(input())
a=list (map(int,input().split()))
abs_list=[]
c=0
for i in range(N):
	c=(a[i]-(i+1))
	abs_list.append(c)
abs_list.sort()
b=abs_list[int(N/2)]	
d=0
for i in range(N):
	d=abs(abs_list[i]-b)+d		
print(d)
Buggy python submission (verdict: Runtime Error):
d,n=map(int,input().split())
if d==0 and n!=100:
    print(n)
elif d==0 and n==100:
    print(101)
elif d==1and n!=100:
    print(n*100)
elif d==1 and n==100:
    print(10100)
elif d==2 and n!=100:
    print(n*10000)
elif d==2 and n==100:
    pront(1010000

Fixed submission:
d,n=map(int,input().split())
if d==0 and n!=100:
    print(n)
elif d==0 and n==100:
    print(101)
elif d==1 and n!=100:
    print(n*100)
elif d==1 and n==100:
    print(10100)
elif d==2 and n!=100:
    print(n*10000) 
elif d==2 and n==100:
    print(1010000)

Buggy python submission (verdict: Runtime Error):
d,n=map(int,input().split())
if d==0 and n!=100:
    print(n)
elif d==0 and n==100:
    print(101)
elif d==1and n!=100:
    print(n*100)
elif d==1 and n=100:
    print(10100)
elif d==2 and n!=100:
    print(n*10000)
elif d==2 and n==100:
    pront(1010000)

Fixed submission:
d,n=map(int,input().split())
if d==0 and n!=100:
    print(n)
elif d==0 and n==100:
    print(101)
elif d==1 and n!=100:
    print(n*100)
elif d==1 and n==100:
    print(10100)
elif d==2 and n!=100:
    print(n*10000) 
elif d==2 and n==100:
    print(1010000)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,k=map(int,input().split())
array=[]
c=[]
for i in range(a,b+1):
    array.append(i)
if k<=b-a+1:
    for i in range(k):
        c.append(array[i])
    for i in range(b-a-k+1,b-a+1):
        c.append(array[i])
    c=set(c)
    c=list(c)
    c.sort()
    for i in range(len(c)):
        print(c[i])
else:
    for i in range(b-a+1):
        print(array[i])


Fixed submission:
a,b,k=map(int,input().split())
c=[]
if k<=b-a+1:
    for i in range(k):
        c.append(a+i)
    for i in range(b-k+1,b+1):
        c.append(i)
    c=set(c)
    c=list(c)
    c.sort()

    for i in range(len(c)):
        print(c[i])
else:
    for i in range(a,b+1):
        print(i)
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int(),input().split())
if a+b>c+d:
    print("Left")
if a+b==c+d:
    print("Balanced")
else:
    print("Right")


Fixed submission:
a,b,c,d=map(int,input().split())
if a+b>c+d:
    print("Left")
if a+b==c+d:
    print("Balanced")
if a+b<c+d:
    print("Right")
Buggy python submission (verdict: Time Limit Exceeded):
def lukas(n):
    if n==0:
        return 2
    elif n==1:
        return 1
    else:
        return lukas(n-1)+lukas(n-2)
n=int(input())
print(lukas(n))            

Fixed submission:
n=int(input())
a=2
b=1
if n==1:
    print(b)
else:
    for i in range(2,n):
        if i%2==0:
            a=a+b
        else:
            b=a+b
    print(a+b)
Buggy python submission (verdict: Runtime Error):
x=int(input())
t=int(input())
if(x-t>=0):
  print(x-t)
else:
  print(0)

Fixed submission:

x,t=map(int,input().split())
if(x-t>=0):
  print(x-t)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
s=input()
array=[]
for i in range (len(s)):
    array.append(s[i])
for i in range(len(set(s)+1)):
    if chr(97+i) in array:
        continue
    else:
        print(chr(97+i))
        exit()
print("None")

Fixed submission:
s=input()
a="abcdefghijklmnopqrstuvwxyz"
for i in a:
    if i not in s:
        print(i)
        exit()
print("None")
Buggy python submission (verdict: Runtime Error):
n=input()
  print('ABC'+n)

Fixed submission:
n=input()
s='ABC'+str(n)
print(s)
Buggy python submission (verdict: Runtime Error):
x,a,b=map(int,input().split)
if(a-b>=0):
  print('delicious')
elif(b-a<=x):
  print('safe')
else:
  print('dangerous')

Fixed submission:
x,a,b=map(int,input().split())
if(a-b>=0):
  print('delicious')
elif(b-a<=x):
  print('safe')
else:
  print('dangerous')
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if (a+b≧24):
    print(a+b-24)
else:
    print(a+b)

Fixed submission:
a,b=map(int,input().split())
if (a+b>=24):
    print(a+b-24)
else:
    print(a+b)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a+b≧24:
    print(a+b-24)
else:
    print(a+b)

Fixed submission:
a,b=map(int,input().split())
if (a+b>=24):
    print(a+b-24)
else:
    print(a+b)
Buggy python submission (verdict: Runtime Error):
def func(num):
    cnt=0
    while(num>0):
        num/=10
        cnt+=1
    return cnt
N=int(input())
ans=100
for i in range(1,N**(1/2)+1):
    tmp=0
    if(N%i==0):
        tmp=max(func(i),func(N/i))
    ans=min(ans,tmp)
print(ans)

Fixed submission:
def func(num):
    cnt=0
    while(num>0):
        num=int(num/10)
        cnt+=1
    return cnt

N=int(input())
ans=100
for i in range(1,int(N**(1/2)+1)):
    tmp=100
    if(N%i==0):
        tmp=max(func(i),func(N/i))
    ans=min(ans,tmp)
print(ans)

Buggy python submission (verdict: Runtime Error):
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T1, class T2>
ostream &operator<<(ostream &s, pair<T1, T2> P)
{
    return s << '<' << P.first << ", " << P.second << '>';
}
template <class T>
ostream &operator<<(ostream &s, vector<T> P)
{
    for (int i = 0; i < P.size(); ++i)
    {
        if (i > 0)
        {
            s << " ";
        }
        s << P[i];
    }
    return s;
}
template <class T>
ostream &operator<<(ostream &s, vector<vector<T>> P)
{
    for (int i = 0; i < P.size(); ++i)
    {
        s << endl
          << P[i];
    }
    return s << endl;
}
template <class T>
ostream &operator<<(ostream &s, set<T> P)
{
    EACH(it, P) { s << "<" << *it << "> "; }
    return s << endl;
}
template <class T1, class T2>
ostream &operator<<(ostream &s, map<T1, T2> P)
{
    EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
    return s << endl;
}
typedef long long ll;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))

int func(long long num){
    int cnt = 0;
    while (num > 0)
    {
        num /= 10;
        cnt++;
    }
    return cnt;
}

int main()
{
    long long  n;
    cin >> n;
    int ans = INF;
    for (int i = 1; i <= sqrt(n) + 1; i++)
    {
        int tmp=INF;
        if (n % i == 0)
        {
            tmp = max(func(i), func(n / i));
            
        }
        ans = min(ans, tmp);
    }
    cout << ans << endl;
}

Fixed submission:
def func(num):
    cnt=0
    while(num>0):
        num=int(num/10)
        cnt+=1
    return cnt

N=int(input())
ans=100
for i in range(1,int(N**(1/2)+1)):
    tmp=100
    if(N%i==0):
        tmp=max(func(i),func(N/i))
    ans=min(ans,tmp)
print(ans)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
to = [[] for _ in range(N)]
count = 0

for _ in range(M):
    A, B = map(lambda x:int(x) - 1, input().split())
    to[A].append(B)
    to[B].append(A)


def dfs(v, to, seen):
    global count
    seen[v] = True
    count += 1
    for nv in to[v]:
        if seen[nv] == True:
            continue
        dfs(nv, to, seen)


def main():
    global count
    seen = [False] * N
    cnts = []
    for i in range(N):
        if not seen[i]:
            dfs(i, to, seen)
            cnts.append(count)
            count = 0
    
    print(max(cnts))


if __name__ == "__main__":
    main()



Fixed submission:
import sys
sys.setrecursionlimit(10**9)


N, M = map(int, input().split())
to = [[] for _ in range(N)]
count = 0

for _ in range(M):
    A, B = map(lambda x:int(x) - 1, input().split())
    to[A].append(B)
    to[B].append(A)


def dfs(v, to, seen):
    global count
    seen[v] = True
    count += 1
    for nv in to[v]:
        if seen[nv]:
            continue
        dfs(nv, to, seen)


def main():
    global count
    seen = [False] * N
    cnts = []
    for i in range(N):
        if not seen[i]:
            dfs(i, to, seen)
            cnts.append(count)
            count = 0
    
    print(max(cnts))


if __name__ == "__main__":
    main()