#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;


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

long long lcm(long long a, long long b){
	if(a<b) swap(a,b);
	if(b==1) return a;
	return a * (b/gcd(a,b));
}

//template<class T>
long long lcm(const vector<long long> v){
	if(v.size()==1) return v[0];
	long long ret = v[0];
	for(int i=1; i<v.size(); i++){
		ret = lcm(ret, v[i]);
	}
	return ret;
}



int main(){
	long long n;
	//cin >> n;
	scanf("%lld", &n);
	long long a,b,c;
	//cin >> a >> b >> c;
	scanf("%lld%lld%lld", &a, &b, &c);
	long long ans = n/a + n/b + n/c - n/lcm(a,b) - n/lcm(b,c) - n/lcm(c,a) + n/lcm({a,b,c});
	//cout << ans << endl;
	printf("%lld\n", ans);
	return 0;
}