Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
    if H[i] >= H[i + 1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 0

print(max(ans))



Fixed submission:
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
    if H[i] >= H[i + 1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 0

ans.append(cnt)
print(max(ans))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = 0

for i in range(N - 1):
    if ans > N - i:
        break
    else:
        cnt = 0
        for j in range(i, N - 1):

            if H[j] >= H[j + 1]:
                cnt += 1
            else:
                break

    if ans < cnt:
        ans = cnt

print(ans)


Fixed submission:
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
    if H[i] >= H[i + 1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 0

ans.append(cnt)
print(max(ans))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
cnt = 0
ans = 0
Hd = sorted(H, reverse=True)


for i in range(N - 1):
    if ans > N - i:
        break

    else:
        idx = H.index(Hd[i])
        cnt = 0
        for j in range(idx, N - 1):
            if H[j] >= H[j + 1]:
                cnt += 1
            else:
                break
    if ans < cnt:
        ans = cnt

print(ans)


Fixed submission:
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
    if H[i] >= H[i + 1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 0

ans.append(cnt)
print(max(ans))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
cnt = 0
ans = 0
Hd = sorted(H, reverse=True)


for i in range(N - 1):

    idx = H.index(Hd[i])

    cnt = 0
    if ans > N - i:
        break

    else:
        for j in range(idx, N - 1):

            if H[j] >= H[j + 1]:
                cnt += 1
            else:
                break

    if ans < cnt:
        ans = cnt

print(ans)


Fixed submission:
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
    if H[i] >= H[i + 1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 0

ans.append(cnt)
print(max(ans))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
cnt = 0
ans = 0


for i in range(N - 1):

    if ans > N - i:
        break

    else:
        for j in range(i, N - 1):

            if H[j] >= H[j + 1]:
                cnt += 1
            else:
                break

    if ans < cnt:
        ans = cnt
    cnt = 0

print(ans)


Fixed submission:
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
    if H[i] >= H[i + 1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 0

ans.append(cnt)
print(max(ans))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
cnt = 0
ans = 0

for i in range(N - 1):

    if ans > N - i:
        break

    else:
        for j in range(i, N - 1):

            if H[j] >= H[j + 1]:
                cnt += 1
            else:
                break

    ans = max(ans, cnt)
    cnt = 0
print(ans)


Fixed submission:
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
    if H[i] >= H[i + 1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 0

ans.append(cnt)
print(max(ans))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
cnt = 0
ans = 0

for i in range(N - 1):

    if ans > N - i:
        break

    else:
        for j in range(i, N - 1):

            if H[j] >= H[j + 1]:
                cnt += 1
            else:
                break

    # print(i, cnt)
    ans = max(ans, cnt)
    cnt = 0

print(ans)


Fixed submission:
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
    if H[i] >= H[i + 1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 0

ans.append(cnt)
print(max(ans))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
cnt = 0
ans = 0

for i in range(N - 1):
    for j in range(i, N - 1):

        if H[j] >= H[j + 1]:
            cnt += 1
        else:
            break
    ans = max(ans, cnt)
    cnt = 0
print(ans)


Fixed submission:
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
    if H[i] >= H[i + 1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 0

ans.append(cnt)
print(max(ans))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
cnt = 0
ans = 0

for i in range(N - 1):

    for j in range(i, N - 1):

        if H[j] >= H[j + 1]:
            cnt += 1
        else:
            break

    # print(i, cnt)
    ans = max(ans, cnt)
    cnt = 0

print(ans)


Fixed submission:
# -*- coding: utf-8 -*-
N = int(input())
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
    if H[i] >= H[i + 1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 0

ans.append(cnt)
print(max(ans))