#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

typedef long long ll;
int const inf = 1<<29;

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

int main() {

  ll N, a, b, c; cin >> N >> a >> b >> c;
  ll x = N / a + N / b + N / c;
  x -= N / lcm(a, b);
  x -= N / lcm(b, c);
  x -= N / lcm(c, a);
  x += N / lcm(lcm(a, b), c);

  cout << x << endl;

  return 0;
}