#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
int main() {
    ll N, m = LONG_LONG_MAX;
    cin >> N;
    rep(i, 5) {
        ll x;
        cin >> x;
        m = min(m, x);
    }
    ll ans = 4 + (ll)ceil(N * 1.0 / m);
    cout << ans << endl;
}
#include <bits/stdc++.h>
#define rep(i, e, n) for (int i = e; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const ll inf=1000000000007;

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