大鱼吃小鱼

class Solution:
    def solve(self , N , A ):
        cnt=0
        split=0
        while len(A)>=2:
            tmp=[]
            for i in range(len(A)-1):
                if i==0:
                    tmp.append(A[i])
                if A[i]>A[i+1]:
                    continue
                else:
                    tmp.append(A[i+1])

            cnt+=1
            flag=False
            for i in range(len(tmp)-1):
                if tmp[i]>tmp[i+1]:
                    flag=True
                    break
            if not flag:
                break
            A=tmp
        return cnt

import sys
nums = int(sys.stdin.readline().strip())
line = sys.stdin.readline().strip()
a = list(map(int, line.split()))
a.reverse()
a.append(0)
times = 0 old = a while True:
    new = []
    flage = False  for i in range(1,len(old)): if old[i]>=old[i-1]:
            flage = True  continue  else:
            flage = True  new.append(old[i-1])
    old = new if flage:
        times+=1   if flage==False: break   print(times)