output_description: Print the number of operations that are necessary until the permutation is
  sorted.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      p_1 p_2 ... p_N
attempt: N = int(input())
  
  p1 = list(map(int, input().split()))
  p2 = []
  
  count = 0
  flag = 0
  flag2 = 1
  
  while flag2 == 1:
      flag = 0
      flag2 = 0
      MAX = 0
      for i in range(N):
          if p1[i] > MAX:
              MAX = p1[i]
              flag = flag + 1
              p2.append(p1[i])
          else:
              L = len(p2)
              p2.insert(L - flag, p1[i])
              if i > 0:
                  if p2[L - flag] > p2[L - flag + 1]:
                      flag2 = 1
                  elif flag < L:
                      if p2[L - flag - 1] > p2[L - flag]:
                          flag2 = 1
  
      p1 = p2[:]
      count = count + 1
      p2.clear()
  
  print(count)
  
problem_description: Statement
  
  Takahashi loves sorting.
  
  He has a permutation (p_1,p_2,...,p_N) of the integers from 1 through N. Now,
  he will repeat the following operation until the permutation becomes
  (1,2,...,N):
  
    * First, we will define _high_ and _low_ elements in the permutation, as follows. The i-th element in the permutation is high if the maximum element between the 1-st and i-th elements, inclusive, is the i-th element itself, and otherwise the i-th element is low.
    * Then, let a_1,a_2,...,a_k be the values of the high elements, and b_1,b_2,...,b_{N-k} be the values of the low elements in the current permutation, **in the order they appear in it**.
    * Lastly, rearrange the permutation into (b_1,b_2,...,b_{N-k},a_1,a_2,...,a_k).
  
  How many operations are necessary until the permutation is sorted?
samples: [{"input": "5\n    3 5 1 2 4", "output": "3\n    \n\nThe initial permutation is (3,5,1,2,4), and each operation changes it as\nfollows:\n\n  * In the first operation, the 1-st and 2-nd elements are high, and the 3-rd, 4-th and 5-th are low. The permutation becomes: (1,2,4,3,5).\n  * In the second operation, the 1-st, 2-nd, 3-rd and 5-th elements are high, and the 4-th is low. The permutation becomes: (3,1,2,4,5).\n  * In the third operation, the 1-st, 4-th and 5-th elements are high, and the 2-nd and 3-rd and 5-th are low. The permutation becomes: (1,2,3,4,5).\n\n* * *"}, {"input": "5\n    5 4 3 2 1", "output": "4\n    \n\n* * *"}, {"input": "10\n    2 10 5 7 3 6 4 9 8 1", "output": "6"}]