题解 | #大雨吃小鱼#

n = int(input())
nums = list(map(int, input().split()))
ans = 0
stack = []

for i in range(n-1, -1, -1):
    cur_turns = 0
    while stack and nums[i] > stack[-1][0]:
        num, turn = stack.pop()
        cur_turns = max(cur_turns + 1, turn)
    stack.append([nums[i], cur_turns])
    ans = max(ans, cur_turns)

print(ans)