import           Control.Monad

readInt :: IO Int
readInt = do
  s <- getLine
  return $ read s

main = do
  n <- readInt
  a <- readInt
  b <- readInt
  c <- readInt
  d <- readInt
  e <- readInt

  let wb = minimum [a, b, c, d, e] -- wb: width of the bottleneck
      ans = (n + wb - 1) `div` wb + (4::Int)

  print ans
