1
#include <bits/stdc++.h>
2
#define endl '\n'
3
using namespace std;
4
typedef long long ll;
5
int main(){
6
    ll n;
7
    cin>>n;
8
    priority_queue<ll> r;
9
    priority_queue<ll,vector<ll>,greater<>> l;
10
    ll tmp;
11
    cin>>tmp;
12
    cout<<tmp<<endl;
13
    r.push(tmp);
14
    for(ll i=1;i<n;i++){
15
        cin>>tmp;
16
        if(tmp>r.top())l.push(tmp);
17
        else r.push(tmp);
18
        while(r.size()>l.size()+1){
19
            l.push(r.top());r.pop();
20
        }
21
        while(l.size()>r.size()+1){
22
            r.push(l.top());l.pop();
23
        }
24
        if(i%2==0)cout<<(l.size()>r.size()?l.top():r.top())<<endl;
25
    }
26
    return 0;
27
}