#40884: 我的解法


richlotw (richlotw)


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

ground = 0
g = []
for i in range(len(h)):

    if (i == len(h) - 1) or (h[i] < h[i + 1]):
        ground += 1
        g.append(ground)
        ground = 0;
    else:
        ground +=1;
        
print(max(g))