#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010

ll lcm(ll a, ll b){
  return a/__gcd(a, b)*b;
}

int main(){
  int n, a, b, c;

  scanf("%d%d%d%d", &n, &a, &b, &c);

  ll ans = 0;

  ans += (ll)n/a + n/b + n/c;
  ans -= n/lcm(a, b) + n/lcm(a, c) + n/lcm(b, c);
  ans += n/lcm(a, lcm(b, c));

  cout << ans << endl;
  
  return 0;
}