N = int(eval(input()))



*H, = list(map(int, input().split()))



max = 0

count = 0

node = 0

while node<N-1:



    if H[node]<H[node+1]:

        if max < count:

            max = count

        count = 0

        node = node + 1

        continue

    count = count + 1

    node = node + 1

if max < count:

    max = count

print(max)
N = int(eval(input()))

*H, = list(map(int, input().split()))



max = 0

temp = 0



for h_index in range(0, len(H)-1, 1):

    if H[h_index]>=H[h_index+1]:

        temp = temp + 1

        continue

    if max < temp:

        max = temp

    temp = 0

if max < temp:

    max = temp



print(max)
N = int(eval(input()))
(*H,) = list(map(int, input().split()))
max = 0
count = 0
node = 0
while node < N - 1:
    if H[node] < H[node + 1]:
        if max < count:
            max = count
        count = 0
        node = node + 1
        continue
    count = count + 1
    node = node + 1
if max < count:
    max = count
print(max)

N = int(eval(input()))
(*H,) = list(map(int, input().split()))
max = 0
temp = 0
for h_index in range(0, len(H) - 1, 1):
    if H[h_index] >= H[h_index + 1]:
        temp = temp + 1
        continue
    if max < temp:
        max = temp
    temp = 0
if max < temp:
    max = temp
print(max)

-count = 0 -node = 0 -while node < N - 1: -    if H[node] < H[node + 1]: -        if max < count: -            max = count -        count = 0 -        node = node + 1 +temp = 0 +for h_index in range(0, len(H) - 1, 1): +    if H[h_index] >= H[h_index + 1]: +        temp = temp + 1 -    count = count + 1 -    node = node + 1 -if max < count: -    max = count +    if max < temp: +        max = temp +    temp = 0 +if max < temp: +    max = temp