N = int(input())
LENGTHS = list(map(int, input().split()))
K = int(input())

solution = 0
LENGTHS.sort(reverse=True)
for i in reversed(range(1, K+1)):
    length = 0
    counts = [i]
    for j in range(N):
        if j == 0:
            length = LENGTHS[j]/i
        else:
            counts.append(LENGTHS[j]//length)
    if sum(counts) == K:
        solution = max(solution, length)
print(solution)