#include <iostream>
using namespace std;

long long gcd(long long m, long long n)
{
  if(!m || !n) return n;

  while(m != n) {
    if(m > n) m = m - n;
    else n = n - m;
  }

  return m;
}

long long lcm(long long m, long long n)
{
  if(!m || !n) return 0;

  return (m / gcd(m, n)) * n;
}

int main(void)
{
  long long n, a, b, c;
  cin >> n >> a >> b >> c;
  cout << n/a + n/b + n/c - n/lcm(a, b) - n/lcm(b, c) - n/lcm(c, a) + n/lcm(a, lcm(b, c)) << endl;
  // cout << lcm(a, b) << ' ' << lcm(b, c) << ' ' << lcm(c, a) << ' ' << lcm(a, lcm(b, c)) << endl;
}