output_description: Print N lines. The i-th line should contain the number of the occurrences of
  the integer i in the lexicographically smallest sequence that can be
  constructed.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 ... a_{N}
attempt: def solve():
      N = int(input())
      A = list(map(int, input().split()))
      ans = [0] * N
      lis = [0] * N
      for i, a in enumerate(A):
          lis[i] = [a, i]
      lis.sort(key=lambda x: (-x[0], -x[1]))
      lis.append([0, 0])
      for i in range(N):
          if lis[i][0] == lis[i + 1][0]:
              continue
          else:
              ans[lis[i][1]] = i + lis[i][0] - lis[i + 1][0]
      return ans
  
  
  print(*solve(), sep="\n")
  
problem_description: Statement
  
  Snuke loves constructing integer sequences.
  
  There are N piles of stones, numbered 1 through N. The pile numbered i
  consists of a_i stones.
  
  Snuke will construct an integer sequence s of length Σa_i, as follows:
  
    1. Among the piles with the largest number of stones remaining, let x be the index of the pile with the smallest index. Append x to the end of s.
    2. Select a pile with one or more stones remaining, and remove a stone from that pile.
    3. If there is a pile with one or more stones remaining, go back to step 1. Otherwise, terminate the process.
  
  We are interested in the lexicographically smallest sequence that can be
  constructed. For each of the integers 1,2,3,...,N, how many times does it
  occur in the lexicographically smallest sequence?
samples: [{"input": "2\n    1 2", "output": "2\n    1\n    \n\nThe lexicographically smallest sequence is constructed as follows:\n\n  * Since the pile with the largest number of stones remaining is pile 2, append 2 to the end of s. Then, remove a stone from pile 2.\n  * Since the piles with the largest number of stones remaining are pile 1 and 2, append 1 to the end of s (we take the smallest index). Then, remove a stone from pile 2.\n  * Since the pile with the largest number of stones remaining is pile 1, append 1 to the end of s. Then, remove a stone from pile 1.\n\nThe resulting sequence is (2,1,1). In this sequence, 1 occurs twice, and 2\noccurs once.\n\n* * *"}, {"input": "10\n    1 2 1 3 2 4 2 5 8 1", "output": "10\n    7\n    0\n    4\n    0\n    3\n    0\n    2\n    3\n    0"}]