Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#include <algorithm>
#include<bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;

int main(){
        int n,a,b;
        int cnt=0;
        cin>>n;
        
        for(int i=0;i<n;i++){
                cin>>a>>b;
                if(a==b){
                        cnt++;
                }else{
                        cnt=0;
                }
                if(cnt==3){
                        cout<<"Yes"<<endl;
                        return 0;
                }
                
        }
        cout<<"No"<<endl;
        return 0;
}


Fixed submission:
n=int(input())
lst=[list(map(int,input().split())) for _ in range(n)]
# print(lst)
cnt=0
ans="No"
for i in range(n):
    a,b=lst[i]
    # print(a,b)
    if a==b:
        cnt+=1
    else:
        cnt=0
    if cnt==3:
        # print(a,b,cnt)
        ans="Yes"
        break

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
cnt=0

for i in range(1,n):
    for j in range(1,int(n)):
        if (n-i) % j ==0:
            cnt+=1
        # print ( f"ここは1回のみカウント：：Ｃは:{i},Aは:{j},Bは：{(n - i) / j}" )
        # print(f"Ｃは:{i},Aは:{j},Bは：{(n-i) / j}")
print(cnt)

Fixed submission:
n=int(input())
cnt=0
for i in range(1,n):
    cnt+=(n-1)//i
        # print(f"Ｃは:{i},Aは:{j},Bは：{(n-i) / j}")
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
lst=list(map(int,input().split()))
# print(sum(lst))
tem=0
for i in range(n-1):
    for j in range(i+1,n):
        tem+=(lst[i] % (10**9+7) )*(lst[j] % (10**9+7) )
        # print(tem)
print(tem % (10**9 +7))

Fixed submission:
n=int(input())
lst=list(map(int,input().split()))
aa=sum(lst) % (10**9+7)
# print(sum(lst) % (10**9+7) )
new_lst=[]
temp_1=aa
for i in range(n-1):
    temp_1-=lst[i]
    new_lst.append(temp_1)
# print(new_lst)

tem=0
for i in range(n-1):
    tem+=(lst[i] )*new_lst[i]
        # print(tem)
print(tem % (10**9 +7))

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
lst=list(map(int,input().split()))
aa=sum(lst) % (10**9+7)
# print(sum(lst) % (10**9+7) )
new_lst=[]
for i in range(n-1):
    new_lst.append((aa- sum(lst[0:i+1]) % (10**9+7)))

tem=0
for i in range(n-1):
    tem+=(lst[i] % (10**9+7) )*new_lst[i]
        # print(tem)
print(tem % (10**9 +7))

Fixed submission:
n=int(input())
lst=list(map(int,input().split()))
aa=sum(lst) % (10**9+7)
# print(sum(lst) % (10**9+7) )
new_lst=[]
temp_1=aa
for i in range(n-1):
    temp_1-=lst[i]
    new_lst.append(temp_1)
# print(new_lst)

tem=0
for i in range(n-1):
    tem+=(lst[i] )*new_lst[i]
        # print(tem)
print(tem % (10**9 +7))

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
lst=list(map(int,input().split()))
aa=sum(lst) % (10**9+7)
# print(sum(lst) % (10**9+7) )
tem=0
for i in range(n-1):
    tem+=(lst[i] % (10**9+7) )*(aa- sum(lst[0:i+1]) % (10**9+7))
        # print(tem)
print(tem % (10**9 +7))

Fixed submission:
n=int(input())
lst=list(map(int,input().split()))
aa=sum(lst) % (10**9+7)
# print(sum(lst) % (10**9+7) )
new_lst=[]
temp_1=aa
for i in range(n-1):
    temp_1-=lst[i]
    new_lst.append(temp_1)
# print(new_lst)

tem=0
for i in range(n-1):
    tem+=(lst[i] )*new_lst[i]
        # print(tem)
print(tem % (10**9 +7))
Buggy python submission (verdict: Runtime Error):
s=input()
if s=="RRR":
    print(3)
elif s="RR":
    print(2)
elif s="R":
    print(1)
else: print(0)


Fixed submission:
s=input()
cnt=0
if s=="SSS":
    cnt=0
elif s=="RRR":
    cnt=3
elif s=="RRS" or s=="SRR":
    cnt=2
else:cnt=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
lst_1=list(map(int,input().split()))
# print(lst_1)
lst_2=[]
for i in range(n-k+1):
    temp=1
    temp=lst_1[i+k]/lst_1[i]
    lst_2.append(temp)
print(lst_2)
for i in range(len(lst_2)-1):
    if lst_2[i]<lst_2[i+1]:
        print("Yes")
    else:print("No")


Fixed submission:
n,k=map(int,input().split())
lst_1=list(map(int,input().split()))
# print(lst_1)
lst_2=[]
for i in range(n-k):
    temp=1
    temp=lst_1[i+k]/lst_1[i]
    lst_2.append(temp)
for i in lst_2:
    if i>1:
        print("Yes")
    else:print("No")

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
lst_1=list(map(int,input().split()))
# print(lst_1)
lst_2=[]
for i in range(n-k+1):
    temp=1
    temp=lst_1[i+k]/lst_1[i]
    lst_2.append(temp)
for i in range(len(lst_2)-1):
    if lst_2[i]<lst_2[i+1]:
        print("Yes")
    else:print("No")


Fixed submission:
n,k=map(int,input().split())
lst_1=list(map(int,input().split()))
# print(lst_1)
lst_2=[]
for i in range(n-k):
    temp=1
    temp=lst_1[i+k]/lst_1[i]
    lst_2.append(temp)
for i in lst_2:
    if i>1:
        print("Yes")
    else:print("No")

Buggy python submission (verdict: Time Limit Exceeded):
n,k=map(int,input().split())
lst_1=list(map(int,input().split()))
# print(lst_1)
lst_2=[]
for i in range(n-k+1):
    temp=1
    for j in range(k):
        temp*=lst_1[i+j]
    lst_2.append(temp)
for i in range(len(lst_2)-1):
    if lst_2[i]<lst_2[i+1]:
        print("Yes")
    else:print("No")

Fixed submission:
n,k=map(int,input().split())
lst_1=list(map(int,input().split()))
# print(lst_1)
lst_2=[]
for i in range(n-k):
    temp=1
    temp=lst_1[i+k]/lst_1[i]
    lst_2.append(temp)
for i in lst_2:
    if i>1:
        print("Yes")
    else:print("No")
Buggy python submission (verdict: Runtime Error):
def main():
    a,v=map(int,input().split())
    b,w=map(int,input().split())
    t=int(input())
    distance=abs(a-b) if a>=b else abs(b-a)
    ve=v-w
    if ve<=0:
        print("NO")
        return
    if distance<=ve*t:
        print("YES")
        return
    else:
   		print("NO")
        return




main()


Fixed submission:
def main():
    a,v=map(int,input().split())
    b,w=map(int,input().split())
    t=int(input())
    distance=abs(a-b) if a>=b else abs(b-a)
    ve=v-w
    if ve<=0:
        print("NO")
        return
    if distance<=ve*t:
        print("YES")
        return
    else:
        print ( "NO" )
        return



main()
Buggy python submission (verdict: Runtime Error):
a,b,c,k=map(int,input().split())
ans=0
if(a>=k):
  ans+=k
  #print(k)
elif(a<k):
  ans+=a
  if(k-a<=b):
    #print(ans)
  elif (k-a>b):
    ans+=b
    ans-=k-a-b
    #print(ans)
print(ans)

Fixed submission:
a,b,c,k=map(int,input().split())
if a>=k:
  print(k)
elif a<k:
  if k-a<=b:
    print(a)
  elif k-a >b:
    print(a-(k-a-b))
Buggy python submission (verdict: Runtime Error):
import math
print(math.pi*input()*2)

Fixed submission:
import math
print(math.pi*int(input())*2)
Buggy python submission (verdict: Runtime Error):
a=input()
cnt=0
for i in a::
  if i=="7":
    cnt+=1
    break
print(["No","Yes"][cnt])

Fixed submission:
a=input()
cnt=0
for i in a:
  if i=="7":
    cnt+=1
    break
print(["No","Yes"][cnt])
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
# a,b,c=map(int,input().split())
cnt=0
def gcd(a,b):
    if a==0: return b
    else: return gcd(b%a,a)
# print(gcd(a,b))

def gcd_3(a,b,c):
    if gcd(a,b)==0: return c
    else: return gcd(c % gcd(a,b),gcd(a,b))

for i in range(1,n+1):
    for j in range ( 1 , n + 1 ):
        for k in range ( 1 , n + 1 ):
            # print(i,j,k)
            cnt+=gcd_3(i,j,k)
print(cnt)

Fixed submission:
n=int(input())
# a,b,c=map(int,input().split())
cnt=0
def gcd(a,b):
    if a==0: return b
    else: return gcd(b%a,a)
# print(gcd(a,b))

def gcd_3(a,b,c):
    if gcd(a,b)==0: return c
    else: return gcd(c % gcd(a,b),gcd(a,b))

for i in range(1,n+1):
    for j in range ( 1 , n + 1 ):
        for k in range ( 1 , n + 1 ):
            # print(i,j,k)
            cnt+=gcd_3(i,j,k)
print(cnt)
Buggy python submission (verdict: Runtime Error):
from math import factorial

x,y=map(int,input().split())

a = factorial(x) / factorial(2) / factorial(x - 2)
b = factorial(y) / factorial(2) / factorial(y - 2)
print(int(a+b))

Fixed submission:
from math import factorial

x,y=map(int,input().split())
if x>1:
    a = factorial(x) / factorial(2) / factorial(x - 2)
else: a=0
if y>1:
    b = factorial(y) / factorial(2) / factorial(y - 2)
else: b=0
print(int(a+b))

Buggy python submission (verdict: Runtime Error):
from scipy import special
x,y=map(int,input().split())

a = special.comb(x, 2, True)
b = special.comb(y, 2, True)

print(a+b)

Fixed submission:
from math import factorial

x,y=map(int,input().split())
if x>1:
    a = factorial(x) / factorial(2) / factorial(x - 2)
else: a=0
if y>1:
    b = factorial(y) / factorial(2) / factorial(y - 2)
else: b=0
print(int(a+b))

Buggy python submission (verdict: Runtime Error):
from scipy import special
x,y=map(int,input().split())

a = special.comb(x, 2, True)
b = special.comb(y, 2, True)

print(a+b)

Fixed submission:
from math import factorial

x,y=map(int,input().split())
if x>1:
    a = factorial(x) / factorial(2) / factorial(x - 2)
else: a=0
if y>1:
    b = factorial(y) / factorial(2) / factorial(y - 2)
else: b=0
print(int(a+b))

Buggy python submission (verdict: Runtime Error):
from scipy import special
x,y=map(int,input().split())

a = special.comb(x, 2, True)
b = special.comb(y, 2, True)

print(a+b)

Fixed submission:
from math import factorial

x,y=map(int,input().split())
if x>1:
    a = factorial(x) / factorial(2) / factorial(x - 2)
else: a=0
if y>1:
    b = factorial(y) / factorial(2) / factorial(y - 2)
else: b=0
print(int(a+b))
Buggy python submission (verdict: Runtime Error):
#include<iostream>
using namespace std;

int main(){
    int a;
    cin>>a;
    cout<<(a+2-1)/2<<endl;
    return 0;

}

Fixed submission:
print((int(input())+1)//2)
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split()) 
lst_b=[] 
lst_c=[] 
while(True): 
    b=n//m 
    c=n%m 
    lst_b.append(b) 
    lst_c.append(c) 
    n=b 
    	if b==0: 
    		print("".join(map(str,lst_c[::-1]))) 
    		break                       

Fixed submission:
n,m=map(int,input().split()) 
lst_b=[] 
lst_c=[] 
while(True): 
    b=n//m 
    c=n%m 
    lst_b.append(b) 
    lst_c.append(c) 
    n=b 
    if b==0: 
    	print(len("".join(map(str,lst_c[::-1])))) 
    	break
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input(),split())
print(-(-a/b))

Fixed submission:
a,b=map(int,input().split())
print(-(-a//b))
Buggy python submission (verdict: Runtime Error):
 n=int(input())
l=input()
cnt=0
for i in range(n-3):
  if l[i:i+3]=="ABC":
    cnt+=1
print(cnt)

Fixed submission:
n=int(input())
l=input()
cnt=0
if n<=2:
  print(0)
  exit()
for i in range(n-2):
  if l[i:i+3]=="ABC":
    cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
print(input()+input())

Fixed submission:
print("".join(reversed(input().split())))
Buggy python submission (verdict: Runtime Error):
a,b,n=map(int(input().split()))
print(max(a-n,0),max(b-max(a-n,0),0))


Fixed submission:
a,b,n=map(int,input().split())  
print(max(a-n,0),max(b-max(n-a,0),0))

Buggy python submission (verdict: Runtime Error):
a,b,n=map(int(input()split()))
print(max(a-n,0),max(b-max(a-n,0),0))

Fixed submission:
a,b,n=map(int,input().split())  
print(max(a-n,0),max(b-max(n-a,0),0))
Buggy python submission (verdict: Runtime Error):
n=int(input())
bool_1=True
while(1):
	for i in range(n**0.5//1):  
		if n % i ==0: 
			bool_1=False
			break
    n+=1      
    if bool_1:break
print(bool_1)

Fixed submission:
n=int(input()) 
m=10**5+4 
for i in range(n,m): 
	lst=[] 
	if all(( i % j) !=0 for  j in range(2,int(n**0.5//1+1))): 
		print(i) 
		break

Buggy python submission (verdict: Runtime Error):
n=int(input()) 
m=10**5+4 
for i in range(n,m): 
	lst=[] 
	if all(( i % j) !=0 for  j in range(2,int(n**0.5//1+1))): 
		print(i,j) 
		break

Fixed submission:
n=int(input()) 
m=10**5+4 
for i in range(n,m): 
	lst=[] 
	if all(( i % j) !=0 for  j in range(2,int(n**0.5//1+1))): 
		print(i) 
		break

Buggy python submission (verdict: Runtime Error):
n=int(input())
m=10**5+1
for j in range()
for i in range(n,m):
  for j in range(2,int(n**0.5//1+1)):
    i % i==0:
      print(i)
      break

Fixed submission:
n=int(input()) 
m=10**5+4 
for i in range(n,m): 
	lst=[] 
	if all(( i % j) !=0 for  j in range(2,int(n**0.5//1+1))): 
		print(i) 
		break
Buggy python submission (verdict: Runtime Error):
from fractions import Fractions  
a,b=map(int,input().split())  
print(a*b//fractions.gcd(a,b))


Fixed submission:
import fractions  
a,b=map(int,input().split())  
print(a*b//fractions.gcd(a,b))

Buggy python submission (verdict: Runtime Error):
from math import fractions  
a,b=map(int,input().split())  
print(a*b//fractions.gcd(a,b))


Fixed submission:
import fractions  
a,b=map(int,input().split())  
print(a*b//fractions.gcd(a,b))

Buggy python submission (verdict: Runtime Error):
import math  
a,b=map(int,input().split())  
print(a*b//fractions.gcd(a,b))

Fixed submission:
import fractions  
a,b=map(int,input().split())  
print(a*b//fractions.gcd(a,b))

Buggy python submission (verdict: Runtime Error):
import math 
a,b=map(int,input().split()) 
print(a*b//math.gcd(a,b))

Fixed submission:
import fractions  
a,b=map(int,input().split())  
print(a*b//fractions.gcd(a,b))

Buggy python submission (verdict: Runtime Error):
import math 
a,b=map(int,input().split()) 
print(a*b//math.gcd(a,b))  

Fixed submission:
import fractions  
a,b=map(int,input().split())  
print(a*b//fractions.gcd(a,b))

Buggy python submission (verdict: Runtime Error):
import math 
a,b=map(int,input().split()) 
print(a*b/math.gcd(a,b))  

Fixed submission:
import fractions  
a,b=map(int,input().split())  
print(a*b//fractions.gcd(a,b))

Buggy python submission (verdict: Runtime Error):
import math
a,b=map(int,input().split())
print(a*b/math.gcd(a,b))

Fixed submission:
import fractions  
a,b=map(int,input().split())  
print(a*b//fractions.gcd(a,b))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
c,d=map(int,input().split())
print([0,1][a==b+1]

Fixed submission:
a,b=map(int,input().split())
c,d=map(int,input().split())
print([0,1][a==c-1])
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>4:
    x=0
else:
    x=a
if b>4:
    y=0
else:
    y=b
if x==1 and y==1:
    ans=1000000
else :
    ans=lst[x]+lst[y]


print(ans)

Fixed submission:
a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>3:
    x=0
else:
    x=a
if b>3:
    y=0
else:
    y=b
if x==1 and y==1:
    ans=1000000
else :
    ans=lst[x]+lst[y]


print(ans)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:1000000}
if a>4:
    x=0
else:
    x=a
if b>4:
    y=0
else:
    y=b
if x==1 and y==1:
    ans=1000000
else :
    ans=lst[x]+lst[y]


print(ans)

Fixed submission:
a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>3:
    x=0
else:
    x=a
if b>3:
    y=0
else:
    y=b
if x==1 and y==1:
    ans=1000000
else :
    ans=lst[x]+lst[y]


print(ans)
Buggy python submission (verdict: Runtime Error):
print((int(input())**2)

Fixed submission:
print((int(input())**2))
Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(1,10):
	if n % i ==0 and n//i <=9:
    	print("Yes")
    	break
else:
	print("No")

Fixed submission:
n=int(input())
for i in range(1,10):
	if n % i ==0 and n//i <=9:
		print("Yes")
		break
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
ef div_make(n):
    divisor =[]
    n=int(n)
    for i in range(1,int(n**0.5)+1):
        if n%i==0:
            divisor.append([i,n//i])
    return divisor

a=int(input())

lst=[]
for i in div_make(a):
    lst.append(i[0]+i[1])
ans=0
ans=min(lst)-2
print(ans)

Fixed submission:
def div_make(n):
    divisor =[]
    n=int(n)
    for i in range(1,int(n**0.5)+1):
        if n%i==0:
            divisor.append([i,n//i])
    return divisor

a=int(input())

lst=[]
for i in div_make(a):
    lst.append(i[0]+i[1])
ans=0
ans=min(lst)-2
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
print(a-2b if a-2b>0 else 0)

Fixed submission:
a,b=map(int,input().split())
print(a-2*b if a-2*b>0 else 0)
Buggy python submission (verdict: Runtime Error):
print(int(input()+0.5)//2)

Fixed submission:
a=int(input()) 
print(((a+1)//2)/a)
Buggy python submission (verdict: Runtime Error):
n,b=map(int(input().split()))
l=list(map(int,input().split()))
cnt=0
for i in l:
  if i>=b:cnt+=1
print(cnt)

Fixed submission:
n,b=map(int,input().split())
l=list(map(int,input().split()))
cnt=0
for i in l:
  if i>=b:cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
n=int(input()) 
l=list(map(int,input().split())) 
dic_l={} 
lst_1=[] 
for i in range(n): 
	dic_l[l[i]]=i 
	for j in range(1,n+1):
		lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))

Fixed submission:
n=int(input()) 
l=list(map(int,input().split())) 
dic_l={} 
lst_1=[] 
for i in range(n): 
	dic_l[l[i]]=i 
for j in range(1,n+1):
	lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))

Buggy python submission (verdict: Runtime Error):
n=int(input()) 
l=list(map(int,input().split())) 
dic_l={} 
lst_1=[] 
for i in range(n): 
  dic_l[l[i]]=i 
  for j in range(1,n+1): 
    lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))

Fixed submission:
n=int(input()) 
l=list(map(int,input().split())) 
dic_l={} 
lst_1=[] 
for i in range(n): 
	dic_l[l[i]]=i 
for j in range(1,n+1):
	lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))

Buggy python submission (verdict: Runtime Error):
n=int(input()) 
l=list(map(int,input().split())) 
	dic_l={} 
	lst_1=[] 
	for i in range(n): 
		dic_l[l[i]]=i 
	for j in range(1,n+1): 
		lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))

Fixed submission:
n=int(input()) 
l=list(map(int,input().split())) 
dic_l={} 
lst_1=[] 
for i in range(n): 
	dic_l[l[i]]=i 
for j in range(1,n+1):
	lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))

Buggy python submission (verdict: Runtime Error):
n=int(input()) 
l=list(map(int,input().split())) 
	dic_l={} 
	lst_1=[] 
	for i in range(n): 
		dic_l[l[i]]=i 
		for j in range(1,n+1): 
			lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1)) 

Fixed submission:
n=int(input()) 
l=list(map(int,input().split())) 
dic_l={} 
lst_1=[] 
for i in range(n): 
	dic_l[l[i]]=i 
for j in range(1,n+1):
	lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))
Buggy python submission (verdict: Runtime Error):
n=int(input())
l=[list(map(int,input().split())) for _ in range(n)]

count_num=0
for i in l[0]:
    count_num += l[1][i-1]
for j in range(n-1):
    if (l[0][j])+1 == l[0][j+1]:
        count_num += l[2][(l[0][j])-1]
    
print(count_num)

Fixed submission:
n=int(input())
l=[list(map(int,input().split())) for _ in range(3)]

count_num=0
for i in l[0]:
    count_num += l[1][i-1]
for j in range(n-1):
    if (l[0][j])+1 == l[0][j+1]:
        count_num += l[2][(l[0][j])-1]
    
print(count_num)
Buggy python submission (verdict: Runtime Error):
i=input()
j=input()
count_num=0
for k in range(3):
  if i[k]==j[k]:
    count_num+=1
print(conut_num)

Fixed submission:
i=input()
j=input()
count_num=0
for k in range(3):
  if i[k]==j[k]:
    count_num+=1
print(count_num)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
for i in range(2,21):
	if b<= a*i-(i+1):
		print(i)
        break

Fixed submission:
a,b=map(int,input().split())
for i in range(21):
	if b<= a*i-(i-1):
		print(i)
		break

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
for i in range(2,21):
	if b=< a*i-(i+1):
		print(i)

Fixed submission:
a,b=map(int,input().split())
for i in range(21):
	if b<= a*i-(i-1):
		print(i)
		break
Buggy python submission (verdict: Runtime Error):
n=int(input())
lst=list(map(int,input().split()))

cnt=0
for i in range(len(lst)-1):
    if lst[i]>=lst[i+1]:
        cnt+=1
    else:
        cnt=0
    ans=max(cnt,ans)
print(ans)

Fixed submission:
n=int(input())
lst=list(map(int,input().split()))
ans=0
cnt=0
for i in range(len(lst)-1):
    if lst[i]>=lst[i+1]:
        cnt+=1
    else:
        cnt=0
    ans=max(cnt,ans)
print(ans)

Buggy python submission (verdict: Runtime Error):
n=int(input())
lst=list(map(int,input().split()))

ans=[]
for i in range(len(lst)-1):
    cnt=0
    for j in range(i,len(lst)-1):
        if lst[j]>=lst[j+1]:
            cnt+=1
        else:
            break
    ans.append(cnt)
    
print(max(ans))

Fixed submission:
n=int(input())
lst=list(map(int,input().split()))
ans=0
cnt=0
for i in range(len(lst)-1):
    if lst[i]>=lst[i+1]:
        cnt+=1
    else:
        cnt=0
    ans=max(cnt,ans)
print(ans)
Buggy python submission (verdict: Runtime Error):
a=int(inpout())
b=input()
print(b if a>=3200 else "red")

Fixed submission:
a=int(input())
b=input()
print(b if a>=3200 else "red")
Buggy python submission (verdict: Runtime Error):
n=int(input())
l=list(map(int,input().split())
sum_m=0
for i in l:
	sum_m+=1/i
print(1/sum_m)


Fixed submission:
n=int(input())
l=list(map(int,input().split()))
sum_m=0
for i in l:
	sum_m+=1/i
print(1/sum_m)

Buggy python submission (verdict: Runtime Error):
n=int(input())
l=list(input().split())
sum_m=0
for i in l:
	sum_m+=1/i
print(1/sum_m)

Fixed submission:
n=int(input())
l=list(map(int,input().split()))
sum_m=0
for i in l:
	sum_m+=1/i
print(1/sum_m)
Buggy python submission (verdict: Runtime Error):
 n=int(input()) 
lst=list(map(int,input().split())) 
#print(lst) 
a=[] 

for i in range(n): 
	if i==0: 
		#print(lst[i]) 
		a.append(lst[i]) 
	else: 
		#print(lst[i]) 
		a.append((a[-1]+lst[i])/2)   
print(a[-1])

Fixed submission:
n=int(input()) 
lst=list(map(int,input().split()))
lst.sort()
#print(lst) 
a=[] 

for i in range(n): 
	if i==0: 
		#print(lst[i]) 
		a.append(lst[i]) 
	else: 
		#print(lst[i]) 
		a.append((a[-1]+lst[i])/2)   
print(a[-1])
Buggy python submission (verdict: Runtime Error):
n=int(input())
l=list(map(int(input().split())))
m=sorted(l)
cnt=0
for i in range(n):
  if l[i]!=m[i]:
    cnt+=1
  if cnt>=3:
    print("NO")
else:print("YES")
  

Fixed submission:
n=int(input())
l=list(map(int,input().split()))
m=sorted(l)
cnt=0
for i in range(n):
  if l[i]!=m[i]:
    cnt+=1
  if cnt>=3:
    print("NO")
    break
else:print("YES")
Buggy python submission (verdict: Runtime Error):
ans=0
right=0
left=0
for i in range(n):
    left=min(a[i],b[i])
    ans+=left
    a[i]-=left
    b[i]-=left
    
    right=min(a[i+1],b[i])
    ans+=right
    a[i+1]-=right
    b[i]-=right
print(ans)

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

ans=0
right=0
left=0
for i in range(n):
    left=min(a[i],b[i])
    ans+=left
    a[i]-=left
    b[i]-=left
    
    right=min(a[i+1],b[i])
    ans+=right
    a[i+1]-=right
    b[i]-=right
print(ans)

Buggy python submission (verdict: Runtime Error):
ns=0
right=0
left=0
for i in range(n):
    left=min(a[i],b[i])
    ans+=left
    a[i]-=left
    b[i]-=left
    
    right=min(a[i+1],b[i])
    ans+=right
    a[i+1]-=right
    b[i]-=right
print(ans)

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

ans=0
right=0
left=0
for i in range(n):
    left=min(a[i],b[i])
    ans+=left
    a[i]-=left
    b[i]-=left
    
    right=min(a[i+1],b[i])
    ans+=right
    a[i+1]-=right
    b[i]-=right
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split()) 
for i in range(21): 
	l=(b*2+1)*i 
		if l>=a: 
			print(i) 
			break

Fixed submission:
a,b=map(int,input().split()) 
for i in range(21): 
	l=(b*2+1)*i 
	if l>=a: 
		print(i) 
		break

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split()) 
for i in range(21): 
	l=(b*2+1)*i 
		if l>=a: 
			print(i) 
			break 


Fixed submission:
a,b=map(int,input().split()) 
for i in range(21): 
	l=(b*2+1)*i 
	if l>=a: 
		print(i) 
		break

Buggy python submission (verdict: Runtime Error):
 a,b=map(int,input().split()) 
for i in range(21): 
	l=(b*2+1)*i 
		if l>=a: 
			print(i) 
			break 

Fixed submission:
a,b=map(int,input().split()) 
for i in range(21): 
	l=(b*2+1)*i 
	if l>=a: 
		print(i) 
		break