#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <assert.h>

using namespace std;
typedef long long ll;
typedef set<int>::iterator ssii;

#define Cmp(a, b) memcmp(a, b, sizeof(b))
#define Cpy(a, b) memcpy(a, b, sizeof(b))
#define Set(a, v) memset(a, v, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define _forS(i, l, r) for(set<int>::iterator i = (l); i != (r); i++)
#define _rep(i, l, r) for(int i = (l); i <= (r); i++)
#define _for(i, l, r) for(int i = (l); i < (r); i++)
#define _forDown(i, l, r) for(int i = (l); i >= r; i--)
#define debug_(ch, i) printf(#ch"[%d]: %d\n", i, ch[i])
#define debug_m(mp, p) printf(#mp"[%d]: %d\n", p->first, p->second)
#define debugS(str) cout << "dbg: " << str << endl;
#define debugArr(arr, x, y) _for(i, 0, x) { _for(j, 0, y) printf("%c", arr[i][j]); printf("\n"); }
#define _forPlus(i, l, d, r) for(int i = (l); i + d < (r); i++)
#define lowbit(i) (i & (-i))
#define MPR(a, b) make_pair(a, b)

pair<int, int> crack(int n) {
    int st = sqrt(n);
    int fac = n / st;
    while (n % st) {
        st += 1;
        fac = n / st;
    }

    return make_pair(st, fac);
}

inline ll qpow(ll a, int n) {
    ll ans = 1;
    for(; n; n >>= 1) {
        if(n & 1) ans *= 1ll * a;
        a *= a;
    }
    return ans;
}

template <class T>
inline bool chmax(T& a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll ksc(ll a, ll b, ll mod) {
    ll ans = 0;
    for(; b; b >>= 1) {
        if (b & 1) ans = (ans + a) % mod;
        a = (a * 2) % mod;
    }
    return ans;
}

ll ksm(ll a, ll b, ll mod) {
    ll ans = 1 % mod;
    a %= mod;

    for(; b; b >>= 1) {
        if (b & 1) ans = ksc(ans, a, mod);
        a = ksc(a, a, mod);
    }

    return ans;
}

template <class T>
inline bool chmin(T& a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

bool _check(int x) {
    //
    return true;
}

int bsearch1(int l, int r) {
    while (l < r) {
        int mid = (l + r) >> 1;
        if(_check(mid)) r = mid;
        else l = mid + 1;
    }
    return l;
}

int bsearch2(int l, int r) {
    while (l < r) {
        int mid = (l + r + 1) >> 1;
        if(_check(mid)) l = mid;
        else r = mid - 1;
    }
    return l;
}

template<class T>
bool lexSmaller(vector<T> a, vector<T> b) {
    int n = a.size(), m = b.size();
    int i;
    for(i = 0; i < n && i < m; i++) {
        if (a[i] < b[i]) return true;
        else if (b[i] < a[i]) return false;
    }
    return (i == n && i < m);
}

// ============================================================== //

const int maxn = 1e5 + 10;
int a[maxn], n = 0, K;

inline bool invalid(int L, int R, int K) {
    return n == 0 || K > (R-L+1) || L > R;
}

int BFPRT(int L, int R, int K);

int getPivot(int L, int R) {
    if (R-L+1 <= 5) {
        sort(a+L, a+R+1);
        return (L+R)>>1;
    }

    int p = L-1;
    // move median to the leftmost
    for (int i = L; i+4 <= R; i += 5) {
        sort(a+i, a+i+5);
        int idx = (i + i+4) >> 1;
        swap(a[++p], a[idx]);
    }

    return BFPRT(L, p, ((p-L+1)>>1) + 1);
}

int partition(int L, int R, int pivot) {
    swap(a[pivot], a[R]);

    int p = L;
    for (int i = L; i < R; i++) if (a[i] < a[R]) {
        swap(a[p++], a[i]);
    }
    swap(a[p], a[R]);
    return p;
}

int BFPRT(int L, int R, int K) {
    if (invalid(L, R, K)) return -1;
    if (L == R) return a[L];

    // get pivot
    int pivot = getPivot(L, R);
    int p = partition(L, R, pivot);
    int num = p-L+1;

    if (num == K) return p;
    else if (num > K) return BFPRT(L, p-1, K);
    else return BFPRT(p+1, R, K-num);
}


void init() {
    n = 0;
}

int main() {
    freopen("input.txt", "r", stdin);
    init();

    // get data
    scanf("%d", &n);
    _for(i, 0, n) scanf("%d", &a[i]);
    scanf("%d", &K);

    // then BFPRT
    int ans = BFPRT(0, 19, K);
    printf("%d\n", a[ans]);
}