#include <cstdio>

using namespace std;

int n;

int a[100];



int main() {

    scanf("%d", &n);

    for (int i = 1; i <= n; ++i)

        scanf("%d", &a[i]);

    int ans = 1;

    for (int i = 1; i <= n; ++i) {

        if (i > 1 && a[i] < a[i - 1])

            ans = i;

        while (ans < n && a[i] >= a[ans + 1])

            ++ans;

        printf("%d\n", ans);

    }

    return 0;

}

#include <iostream>

using namespace std;



const int maxn = 1000;

int n;

int fa[maxn], cnt[maxn];



int getRoot(int v) {

    if (fa[v] == v) return v;

    return getRoot(fa[v]);

}



int main() {

    cin >> n;

    for (int i = 0; i < n; ++i) {

        fa[i] = i;

        cnt[i] = 1;

    }

    int ans = 0;

    for (int i = 0; i < n - 1; ++i) {

        int a, b, x, y;

        cin >> a >> b;

        x = getRoot(a);

        y = getRoot(b);

        ans += cnt[x] * cnt[y];

        fa[x] = y;

        cnt[y] += cnt[x];

    }

    cout << ans << endl;

    return 0;

}

#include <iostream>

#include <string>

using namespace std;

const int max1 = 202;

string s, t;

int pre[max1], suf[max1];



int main() {

    cin >> s >> t;

    int slen = s.length(), tlen = t.length();



    for (int i = 0, j = 0; i < slen; ++i) {

        if (j < tlen && s[i] == t[j]) ++j;

        pre[i] = j; // t[0..j-1] 是 s[0..i] 的子序列

    }



    for (int  i = slen - 1 , j = tlen - 1; i >= 0; --i) {

        if(j >= 0 && s[i] == t [j]) --j;

        suf[i]= j; // t[j+1..tlen-1] 是 s[i..slen-1] 的子序列

    }



    suf[slen] = tlen -1;

    int ans = 0;

    for (int i = 0, j = 0, tmp = 0; i <= slen; ++i){

        while(j <= slen && tmp >= suf[j] + 1) ++j;

        ans = max(ans, j - i - 1);

        tmp = pre[i];

    }

    cout << ans << endl;

    return 0;

}

#include<cstdio>

using namespace std;

const int maxn = 1001;



int n;

int cnt[maxn];

int child [maxn][maxn];

int unlock[maxn];

int threshold[maxn], bonus[maxn];

int points;

bool find(){

    int target = -1;

    for (int i = 1; i <= n; ++i)

        if(① && ②){

            target = i;

            break;

    }

    if(target == -1)

        return false;

    unlock[target] = -1;

    ③

    for (int i = 0; i < cnt[target]; ++i)

        ④

    return true;

}



int main(){

    scanf("%d%d", &n, &points);

    for (int i = 1; i <= n; ++i){

        cnt[i] = 0;

        scanf("%d%d", &threshold[i], &bonus[i]);

    }

    for (int i = 1; i <= n; ++i){

        int m;

        scanf("%d", &m);

        ⑤

        for (int j = 0; j < m; ++j){

            int fa;

            scanf("%d", &fa);

            child[fa][cnt[fa]] = i;

            ++cnt[fa];

        }

    }



    int ans = 0;

    while(find())

        ++ans;



    printf("%d\n", ans);

    return 0;

}

#include <cstdio>

#include<algorithm>

using namespace std;

const int maxn = 64;

int n, m;

int a[maxn], b[maxn];

unsigned long long status, trans;

bool win;

int main(){

    scanf("%d%d", &n, &m);

    for (int i = 0; i < n; ++i)

        scanf("%d%d", &a[i], &b[i]);

    for(int i = 0; i < n; ++i)

        for(int j = i + 1; j < n; ++j)

            if (aa[i] > a[j]){

                swap(a[i], a[j]);

                swap(b[i], b[j]);

            }

    status = ①;

    trans = 0;

    for(int i = 1, j = 0; i <= m; ++i){

        while (j < n && ②){

            ③;

            ++j;

        }

        win = ④;

        ⑤;

    }



    puts(win ? "Win" : "Loss");



    return 0;

}