#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<utility>
#include <fstream>
#include<set>
#include<map>
#include<cctype>
#include<cmath>
#include<algorithm>
#include <numeric>
using namespace std;


#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,Nof(a))
#define found(s,e) ((s).find(e)!=(s).end())

typedef pair<int,int> P;
typedef vector<pair<int,int> > pii;
typedef map<string,int> mdi;


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) {
	return a / gcd(a, b) * b;
}

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