#include <stdio.h>
#include <stdlib.h>

// Comparison function for qsort
int compare(const void *a, const void *b) {
    return ((int)a - (int)b);
}

// Function to find the k-th smallest element using pointers
int findKthSmallest(int *arr, int n, int k) {
    qsort(arr, n, sizeof(int), compare); // sort array
    return *(arr + (k - 1)); // pointer arithmetic
}

int main() {
    int n, k;
    scanf("%d", &n);

    if (n <= 0 || n > 10) {
        printf("Invalid Input\n");
        return 0;
    }

    int arr[n];
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    scanf("%d", &k);

    if (k <= 0 || k > n) {
        printf("Invalid Input\n");
        return 0;
    }

    int result = findKthSmallest(arr, n, k);
    printf("%d\n", result);

   return 0;
}