// 7/3
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;

int main() {
    // ll N, A, B, C, D, E;
    // cin >> N >> A >> B >> C >> D >> E;
    ll N, A[5];
    cin >> N;
    rep(i, 5) cin >> A[i];
    sort(A, A + 5);

    ll mn = A[0];

    cout << (N + mn - 1) / mn + 4 << endl;


}
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  ll n, a, b, c, d, e;
  cin >> n >> a >> b >> c >> d >> e;
  ll mn = min({a, b, c, d, e});
  ll m = (n+mn-1)/mn;
  ll ans = m + 4;
  cout << ans << endl;
  return 0;
}