#include<bits/stdc++.h>
using namespace std;
 
struct cmp{
    bool operator()(pair<int,int> &p1, pair<int,int> &p2){
        return p1.first>p2.first;
    }
};
 
int main(){
 
    int n;cin>>n;
    int arr[n];
    for(int i=0;i<n;i++)
        cin>>arr[i];
 
    int k;cin>>k;
 
    priority_queue<pair<int,int>,vector<pair<int,int>>, cmp> pq;
    int i=0,j=0,res=0;
    while(j<n){
        pq.push({arr[j],j});
        if(j-i == k){
            //do something
            while(pq.top().second <= i)
                pq.pop();
            i++;
        }
        if(pq.size() >= k)
        	res = max(pq.top().first,res);    
        j++;
    }
    cout<<res<<endl;
    return 0;
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnN0cnVjdCBjbXB7CiAgICBib29sIG9wZXJhdG9yKCkocGFpcjxpbnQsaW50PiAmcDEsIHBhaXI8aW50LGludD4gJnAyKXsKICAgICAgICByZXR1cm4gcDEuZmlyc3Q+cDIuZmlyc3Q7CiAgICB9Cn07CgppbnQgbWFpbigpewoKICAgIGludCBuO2Npbj4+bjsKICAgIGludCBhcnJbbl07CiAgICBmb3IoaW50IGk9MDtpPG47aSsrKQogICAgICAgIGNpbj4+YXJyW2ldOwoKICAgIGludCBrO2Npbj4+azsKCiAgICBwcmlvcml0eV9xdWV1ZTxwYWlyPGludCxpbnQ+LHZlY3RvcjxwYWlyPGludCxpbnQ+PiwgY21wPiBwcTsKICAgIGludCBpPTAsaj0wLHJlcz0wOwogICAgd2hpbGUoajxuKXsKICAgICAgICBwcS5wdXNoKHthcnJbal0san0pOwogICAgICAgIGlmKGotaSA9PSBrKXsKICAgICAgICAgICAgLy9kbyBzb21ldGhpbmcKICAgICAgICAgICAgd2hpbGUocHEudG9wKCkuc2Vjb25kIDw9IGkpCiAgICAgICAgICAgICAgICBwcS5wb3AoKTsKICAgICAgICAgICAgaSsrOwogICAgICAgIH0KICAgICAgICBpZihwcS5zaXplKCkgPj0gaykKICAgICAgICAJcmVzID0gbWF4KHBxLnRvcCgpLmZpcnN0LHJlcyk7ICAgIAogICAgICAgIGorKzsKICAgIH0KICAgIGNvdXQ8PHJlczw8ZW5kbDsKICAgIHJldHVybiAwOwp9

Mwo4IDIgNAoy

3
8 2 4
2