#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

ll lcm(ll a,ll b){
  return (a*b/__gcd(a,b));
}
ll lcm(ll a,ll b,ll c){
  ll res = 1;
  ll g = __gcd(a,__gcd(b,c));
  res *= g; a/=g;b/=g;c/=g;
  g = __gcd(a,b);
  res *= g; a/=g;b/=g;
  g = __gcd(b,c);
  res *= g; b/=g;c/=g;
  g = __gcd(c,a);
  res *= g; c/=g;a/=g;
  res *= a;
  res *= b;
  res *= c;
  return res;
}

int main(){
  ll n;
  vl a(3);
  cin >> n >> a[0] >> a[1] >> a[2];
  ll result = 0;
  result += n/a[0] + n/a[1] + n/a[2];
  result -= n/lcm(a[0],a[1]) + n/lcm(a[1],a[2]) + n/lcm(a[2],a[0]);
  result += n/lcm(a[0],a[1],a[2]);
  cout << result << endl;
  return 0;
}