#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

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

int main(){
	lint a,b,c,n,ans=0,lca,lab,lbc,labc;
	cin>>n>>a>>b>>c;

	lca=c*a/gcd(c,a);
	lab=a*b/gcd(a,b);
	lbc=b*c/gcd(b,c);
	labc=lab*c/gcd(lab,c);
	//o(lab<<" "<<lbc<<" "<<lca<<" "<<labc);

	if(a==b && b==c){
		ans=n/a;
	}else if(a==b||b==c){
		ans=n/a+n/c-n/lca;
	}else{
		ans=n/a+n/b+n/c-n/lab-n/lbc-n/lca+n/labc;
	}
	o(ans);
}