n=int(input())
l=list(map(int,input().split()))
k=int(input())

left=0
right=max(l)+1
def wari(m,l,k):
  ans=0
  for i in l:
    ans+=i//m
  if ans<k:
    return True
  else:
    return False
while True:
  mid=(left+right)/2
  if wari(mid,l,k):
    if mid==right:
      break
    right=mid
  else:
    if mid==left:
      break
    left=mid
print(left)