#include <iostream>
#include <cmath>
using namespace std;
int partition(int * a, int l, int r) {
    int v = a[(l + r) / 2];
    int i = l;
    int j = r;
    while (i <= j) {
        while (a[i] < v)
            i++;
        while (a[j] > v)
            j--;

        if (i >= j)
            break;
        swap(a[i++], a[j--]);
    }
    return j;
}

int findOrderStatistic(int* array, int k, int n) {
    int left = 0, right = n - 1;
    while (true) {
        int mid = partition(array, left, right);
        if (mid == k) {
            return array[mid];
        }
        else if (k < mid) {
            right = mid;
        }
        else {
            left = mid + 1;
        }
    }
}


int main() {
    int n, k;
    cin >> n;
    int* a = new int[n];
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (int i = 0; i < n; ++i) {
        cout << a[i] << ' ';
    }
    cout << endl;
    for (int k = 0; k < 3; ++k) {
        int m;
        cin >> m;
        cout << findOrderStatistic(a, m, n);
    }

    return 0;
}