import heapq
def main():
n = int(input())
nums = list(map(int,input().split()))
nums = list(set(nums))
# nums.reverse()
heapq.heapify(nums)
k = int(input())
print(heapq.nsmallest(k,nums)[-1])
if __name__=='__main__':
try:
main()
except:
pass