#include <bits/stdc++.h>

using namespace std;

#define INF 2000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;

ll gcd( ll m, ll n )
{
	if ( ( 0 == m ) || ( 0 == n ) )
		return 0;

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

ll lcm( ll m, ll n )
{
	if ( ( 0 == m ) || ( 0 == n ) )
		return 0;

	return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}//lcm
int main()
{
	ll n;
	cin >> n;
	ll a, b, c;
	cin >> a >> b >> c;

	ll ac = n/lcm(a,c);
	ll ab = n/lcm(a,b);
	ll bc = n/lcm(c,b);
	ll abc = n/lcm(lcm(a,c),b);
	ll ret = n/a + n/b + n/c - (ab+ac+bc) + abc;

	cout << ret << endl;
}