#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<60;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

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

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

int main() {
	ll n, a[3];
	
	cin >> n;
	REP(i, 3) cin >> a[i];
	
	ll ans = 0;
	
	FOR(i, 1, 1<<3) {
		ll now = 0, cnt = 0;
		REP(j, 3) if (i >> j & 1) {
			if (now == 0) now = a[j];
			else now = lcm(now, a[j]);
			cnt++;
		}
		
		ans += n / now * (cnt & 1 ? 1 : -1);
	}
	
	cout << ans << endl;
	
	return 0;
}