#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll gcd(ll a, ll b) {
  return b ? gcd(b, a % b) : a;
}

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  
  int n;
  ll x[3];
  cin >> n;
  for (int i = 0; i < 3; i++) {
    cin >> x[i];
  }

  ll ans = 0;
  for (int i = 1; i < 1 << 3; i++) {
    ll lcm = 1;
    for (int j = 0; j < 3; j++) {
      if (!(i >> j & 1)) continue;
      lcm = lcm / gcd(lcm, x[j]) * x[j];
      if (lcm > n) break;
    }
    int sgn = __builtin_popcount(i) & 1 ? 1 : -1;
    ans += sgn * n / lcm;
  }
  cout << ans << endl;

  return 0;
}