#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <utility>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vec vector
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
#define PI 3.1415926535
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};

using namespace std;

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

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

int main(){
    ll n;
    cin>>n;
    ll a,b,c;
    cin>>a>>b>>c;

    ll ans=0,ans1=0,ans2=0;
    ans=n/a+n/b+n/c;
    ans1=n/acm(a,b)+n/acm(b,c)+n/acm(a,c);
    ans2=n/acm(a,acm(b,c));
    cout<<ans-ans1+ans2<<endl;

    
    return 0;
}