N = int(eval(input()))

numbers = [int(n) for n in input().split(' ')]

distances = []

counter = 0

for i in range(0, len(numbers)):

    if i == len(numbers) - 1:

        distances.append(counter)

        break

    if numbers[i] >= numbers[i + 1]:

        counter += 1

    else:

        distances.append(counter)

        counter = 0

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

numbers = [int(n) for n in input().split(' ')]



counter = -1

last_h = float('inf')

_max = 0

for h in numbers:

    if h <= last_h:

        counter += 1

    else:

        if _max < counter:

            _max = counter

        counter = 0

    last_h = h

if _max < counter:

    _max = counter

print(_max)

N = int(eval(input()))
numbers = [int(n) for n in input().split(" ")]
distances = []
counter = 0
for i in range(0, len(numbers)):
    if i == len(numbers) - 1:
        distances.append(counter)
        break
    if numbers[i] >= numbers[i + 1]:
        counter += 1
    else:
        distances.append(counter)
        counter = 0
print((max(distances)))

N = int(eval(input()))
numbers = [int(n) for n in input().split(" ")]
counter = -1
last_h = float("inf")
_max = 0
for h in numbers:
    if h <= last_h:
        counter += 1
    else:
        if _max < counter:
            _max = counter
        counter = 0
    last_h = h
if _max < counter:
    _max = counter
print(_max)

-distances = [] -counter = 0 -for i in range(0, len(numbers)): -    if i == len(numbers) - 1: -        distances.append(counter) -        break -    if numbers[i] >= numbers[i + 1]: +counter = -1 +last_h = float("inf") +_max = 0 +for h in numbers: +    if h <= last_h: -        distances.append(counter) +        if _max < counter: +            _max = counter -print((max(distances))) +    last_h = h +if _max < counter: +    _max = counter +print(_max)