#include <bits/stdc++.h> 
using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1LL<<60;
const ll mod = 1e9 + 7;
const double eps = 1e-9;

/*
*/

int gcd(int a, int b)
{
  if(a < b) return gcd(b, a);
  if(b == 0) return a;
  return gcd(b, a%b);
}

int main()
{
#define int long long
  int n, a, b, c;
  cin >> n >> a >> b >> c;

  int na = n / a;
  int nb = n / b;
  int nc = n / c;

  int ab = a*b/gcd(a,b);
  int nab = n / ab;
  int bc = b*c/gcd(b,c);
  int nbc = n / bc;
  int ca = c*a/gcd(c,a);
  int nca = n / ca;

  int nabc = n / (ab*bc/gcd(ab,bc));

//  printf("%lld, %lld, %lld\n", na, nb, nc);
//  printf("%lld, %lld, %lld\n", nab, nbc, nca);
//  printf("%lld\n", nabc);

  cout << na+nb+nc-(nab+nbc+nca)+nabc << endl;

  return 0;
}