You are given a permutation $$$P$$$ of length $$$N$$$.
For each prefix of this permutation, you need to compute its median.
The first line contains one integer $$$N$$$ $$$(1 \le N \le 2 \cdot 10^5)$$$ — the length of the permutation.
The second line contains $$$N$$$ integers $$$P_1, P_2, \ldots, P_N$$$ $$$(1 \le P_i \le N)$$$ separated by spaces — the elements of the permutation.
It is guaranteed that all values $$$P_i$$$ are distinct.
Print $$$N$$$ integers $$$M_1, M_2, \ldots, M_N$$$ separated by spaces, where $$$M_i$$$ is the doubled median of the elements $$$P_1, \ldots, P_i$$$ (that is, the median of the first $$$i$$$ elements of the permutation multiplied by $$$2$$$).
75 2 1 4 7 6 3
10 7 4 6 8 9 8
The median of a set of $$$k$$$ numbers sorted in nondecreasing order as $$$a_1 \le a_2 \le \ldots \le a_k$$$ is defined as:
Since the median for even $$$k$$$ may not be an integer, you should output its doubled value — it is always an integer.
Let us consider the first example step by step. At each step $$$i$$$, we consider the prefix of the first $$$i$$$ elements of the permutation sorted in nondecreasing order, and compute its doubled median $$$M_i$$$:
| Name |
|---|


