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:
 - 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.
 - Select a pile with one or more stones remaining, and remove a stone from that pile.
 - 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?

-----Constraints-----
 - 1 ≤ N ≤ 10^{5}
 - 1 ≤ a_i ≤ 10^{9}

-----Input-----
The input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}

-----Output-----
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.

-----Sample Input-----
2
1 2

-----Sample Output-----
2
1

The lexicographically smallest sequence is constructed as follows:
 - 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.
 - 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.
 - 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.
The resulting sequence is (2,1,1). In this sequence, 1 occurs twice, and 2 occurs once.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'import collections\nimport heapq\nn=int(input())\nA=[int(i) for i in input().split()]\nAns=[0]*n\nM=[0]#自分より前の最大値をメモ。これ以下だと現れない\nfor i in range(n):\n  M.append(max(M[-1],A[i]))\nD=collections.defaultdict(int)\nH=[]\nfor i in range(n):\n  j=n-1-i\n  if A[j]<=M[j]:\n    heapq.heappush(H,-A[j])#出現しないインデックスの数を管理。大きいほうから取り出す。\n  else:\n    Ans[j]=(A[j]-M[j])*(D[A[j]]+1)#自分より前の最大値と自分の差かける自分自身と同じ数のこれまでの出現回数\n    D[M[j]]+=D[A[j]]+1#自分自身より後ろの自分と同じ数全てを自分より前の最大値まで減らすことで増える分\n    ct=0\n    while H:#自分より後ろで自分より小さいが、自分の前の最大値より大きいものを全て見る\n      a=heapq.heappop(H)\n      a=-a\n      if a<=M[j]:\n        heapq.heappush(H,-a)\n        break\n      else:\n        Ans[j]+=a-M[j]\n        D[M[j]]+=1\n\nfor a in Ans:\n  print(a)\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13555