Sorting the Coins（思维）

Sorting the Coins

Recently, Dima met with Sasha in a philatelic store, and since then they are collecting coins together. Their favorite occupation is to sort collections of coins. Sasha likes having things in order, that is why he wants his coins to be arranged in a row in such a way that firstly come coins out of circulation, and then come coins still in circulation.

For arranging coins Dima uses the following algorithm. One step of his algorithm looks like the following:

1. He looks through all the coins from left to right;
2. If he sees that the i-th coin is still in circulation, and (i + 1)-th coin is already out of circulation, he exchanges these two coins and continues watching coins from (i + 1)-th.

Dima repeats the procedure above until it happens that no two coins were exchanged during this procedure. Dima calls hardness of ordering the number of steps required for him according to the algorithm above to sort the sequence, e.g. the number of times he looks through the coins from the very beginning. For example, for the ordered sequence hardness of ordering equals one.

Today Sasha invited Dima and proposed him a game. First he puts n coins in a row, all of them are out of circulation. Then Sasha chooses one of the coins out of circulation and replaces it with a coin in circulation for n times. During this process Sasha constantly asks Dima what is the hardness of ordering of the sequence.

The task is more complicated because Dima should not touch the coins and he should determine hardness of ordering in his mind. Help Dima with this task.

Input

The first line contains single integer n (1 ≤ n ≤ 300 000) — number of coins that Sasha puts behind Dima.

Second line contains n distinct integers p₁, p₂, ..., p_n (1 ≤ p_i ≤ n) — positions that Sasha puts coins in circulation to. At first Sasha replaces coin located at position p₁, then coin located at position p₂ and so on. Coins are numbered from left to right.

Output

Print n + 1 numbers a₀, a₁, ..., a_n, where a₀ is a hardness of ordering at the beginning, a₁ is a hardness of ordering after the first replacement and so on.

Examples

Input

4
1 3 4 2

Output

1 2 3 2 1

Input

8
6 8 3 4 7 2 1 5

Output

1 2 2 3 4 3 4 5 1

Note

Let's denote as O coin out of circulation, and as X — coin is circulation.

At the first sample, initially in row there are coins that are not in circulation, so Dima will look through them from left to right and won't make any exchanges.

After replacement of the first coin with a coin in circulation, Dima will exchange this coin with next three times and after that he will finally look through the coins and finish the process.

XOOO  →  OOOX

After replacement of the third coin, Dima's actions look this way:

XOXO  →  OXOX  →  OOXX

After replacement of the fourth coin, Dima's actions look this way:

XOXX  →  OXXX

Finally, after replacement of the second coin, row becomes consisting of coins that are in circulation and Dima will look through coins from left to right without any exchanges.

题意：

最开始有一串全部由“O”组成的字符串，现在给出n个数字，指的是每次把位置n上的“O”变为“X”，之后会进行扫描。

扫描的规则是如果遇到一个字符为“X”并且这个字符后面的字符为“O”，那么就交换。

如果哪一次扫描没有发生交换，那么扫描就停止。

现在给出的n个数字，问第一次需要扫描多少次，第二次需要扫描多少次。。。。第n+1次需要扫描多少次（第一次指的是全部都是“O”，还没有替换为“X”）。

思路：

每一次，根据题意，只要扫描一次就可以把一个X一直交换到最后，所以用了一种十分巧妙的方式：只需要统计下标最大的“O”之前有多少个“X”即可，

一开始最大下标位置在n，之后每一次替换就把这个位置占领了，之后判断最大下标的位置是否被占领，如果被占领就一直把最大位置下标递减，同时减去已经有的“X”的数量（后面的“X”没有移动，所以要减去）。

之后输出还有的“X”的数量加1即可（加一是最后还要扫一遍）。

code：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
bool a[300005];

int main(){
    int n;
    scanf("%d",&n);
    printf("1 ");
    int cnt = 0;
    int k = n;
    for(int i = 1; i <= n; i++){
        int t;
        scanf("%d",&t);
        a[t] = 1;
        cnt++;
        while(a[k]){
            k--;
            cnt--;
        }
        if(i != n) printf("%d ",cnt+1);
        else printf("%d",cnt+1);
    }
    printf("\n");
    return 0;
}