#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <string>
#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <queue>
#include <time.h>
#include <sys/time.h>
#include <unistd.h>
#include <locale.h>
#include <algorithm>
#include <map>
#include <malloc.h>
#include <unordered_map>
#include <set>

using namespace std;
typedef long long ll;


int main()
{

    multiset<int> s;
    vector<int> v;

    int m;
    cin>>m;
    while(true)
    {
        int tmp;
        cin>>tmp;
        if(tmp == -1)
            break;
        v.push_back(tmp);
    }

    int ptr1 = 0, ptr2 = 0;
    for(; ptr2 < m; ++ptr2)
    {
        s.insert(v[ptr2]);
    }
    int curAns = *s.rbegin();
    cout<<curAns<<"\n";
    while(ptr2 < v.size())
    {
        auto it = s.find(v[ptr1]);
        s.erase(it);
        s.insert(v[ptr2]);
        ptr1++;
        ptr2++;
        curAns = *s.rbegin();
        cout<<curAns<<"\n";
    }

    return 0;
}