#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int main(){
  ll n;
  vl a(3);
  cin >> n >> a[0] >> a[1] >> a[2];
  ll result = 0;
  sort(ALL(a),greater<ll>());
  if(a[1]%a[2]==0)a[1]=n;
  if(a[0]%a[2]==0)a[0]=n;
  if(a[0]%a[1]==0)a[0]=n;
  a.erase(remove(ALL(a),n),a.end());
  if(a.size()==1){
    result = n/a[0];
  }else if(a.size()==2){
    result += n/a[0] + n/a[1];
    result -= n/(a[0]*a[1]/__gcd(a[0],a[1]));
  }else if(a.size()==3){
    result += n/a[0] + n/a[1] + n/a[2];
    result -= n/(a[0]*a[1]/__gcd(a[0],a[1])) + n/(a[1]*a[2]/__gcd(a[1],a[2])) + n/(a[2]*a[0]/__gcd(a[2],a[0]));
    result += n/(a[0]*a[1]*a[2]/__gcd(a[0],__gcd(a[1],a[2])));
  }
  cout << result << endl;
  return 0;
}