n = int(eval(input()))

h = list(map(int,input().split()))



count = [0]*(n-1)

j = 0

count2 = [0]*(n-2)



for i in range(n-1):

    if h[i] > h[i+1]:

        count[i] = 1

    if h[i] < h[i+1]:

        count[i] = 0

    if h[i] == h[i+1]:

        count[i] = 1



# print(count)

z = 0

for i in range(n-2):

    if count[i] == count[i+1] and count[i]==1:

        count2[j] += 1

        z = 1

    else:

        j += 1

if z == 1:

    print((max(count2)+1))

else:

    print('0')

    

        



    



n = int(eval(input()))

h = list(map(int,input().split()))

count = 0

ans = 0

h.reverse()

for i in range(n-1):

    if h[i]<=h[i+1]:

        count += 1

    else:

        count = 0

    ans = max(ans,count)

print(ans)
n = int(eval(input()))
h = list(map(int, input().split()))
count = [0] * (n - 1)
j = 0
count2 = [0] * (n - 2)
for i in range(n - 1):
    if h[i] > h[i + 1]:
        count[i] = 1
    if h[i] < h[i + 1]:
        count[i] = 0
    if h[i] == h[i + 1]:
        count[i] = 1
# print(count)
z = 0
for i in range(n - 2):
    if count[i] == count[i + 1] and count[i] == 1:
        count2[j] += 1
        z = 1
    else:
        j += 1
if z == 1:
    print((max(count2) + 1))
else:
    print("0")

n = int(eval(input()))
h = list(map(int, input().split()))
count = 0
ans = 0
h.reverse()
for i in range(n - 1):
    if h[i] <= h[i + 1]:
        count += 1
    else:
        count = 0
    ans = max(ans, count)
print(ans)

-count = [0] * (n - 1) -j = 0 -count2 = [0] * (n - 2) +count = 0 +ans = 0 +h.reverse() -    if h[i] > h[i + 1]: -        count[i] = 1 -    if h[i] < h[i + 1]: -        count[i] = 0 -    if h[i] == h[i + 1]: -        count[i] = 1 -# print(count) -z = 0 -for i in range(n - 2): -    if count[i] == count[i + 1] and count[i] == 1: -        count2[j] += 1 -        z = 1 +    if h[i] <= h[i + 1]: +        count += 1 -        j += 1 -if z == 1: -    print((max(count2) + 1)) -else: -    print("0") +        count = 0 +    ans = max(ans, count) +print(ans)