#include <iostream>
#include <algorithm>

using namespace std;

long long gcd(long long a, long long b) {
	do {
		if (a < b) {
			swap(a, b);
		}
		a = a % b;
	} while (a > 0);
	return b;
}

long long lcm(long long a, long long b) {
	return a * b / gcd(a, b);
}

long long lcm(long long a, long long b, long long c) {
	return lcm(a, lcm(b, c));
}

int main() {
	long long n, a, b, c;
	cin >> n >> a >> b >> c;
	long long result = n / a + n / b + n / c 
		- n / lcm(a, b) - n / lcm(b, c) - n / lcm(c, a)
		+ n / lcm(a, b, c);
	cout << result << endl;
	return 0;
}