#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout<<(p)<<endl;
#define pi 3.1415926535
using namespace std;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

unsigned long long sttoi(std::string str) {
	unsigned long long ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}
ll gcd(ll a, ll b){
	if (b > a)swap(a, b);
	if (b == 0) return a;
	return gcd(b, a%b);
}
void solve() {
	ll n, a, b, c;
	cin >> n >> a >> b >> c;
	ll ans;
	if (b%a == 0  && c%a == 0){
		ans = n / a;
	}
	else if (b%a == 0 && c%a != 0){
		ans = n / a + n / c - n / ((a*c)/gcd(a,c));
	}
	else if (c%a == 0 && b%a != 0){
		ans = n / a + n / b - n / (a*b/gcd(a,b));
	}
	else{
		ans = n / a + n / b + n / c - n / (a*b / gcd(a, b)) - n / (b*c / gcd(b, c)) - n / (c*a / gcd(a, c)) + n / ((c*a*b / gcd(a, b)) / gcd(a*b / gcd(a, b), c));
	}
	P(ans);
}

int main() {
	solve();
	return 0;
}