//PLEASE GOD MAKE THIS CODE ACCEPTED SOLUTION
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define int long long
#define forn(i,a,n) for(int i = a; i<n; i++)
#define fornr(i,a,n) for(int i = n-1; i>=a; i--)
#define print(a) cout<<a<<"\n";
#define printarr(a)                 \
    forn(i,0,a.size()) cout<<a[i]<<" ";\
    cout<<endl;
 
#define pb push_back
#define all(a) a.begin(), a.end()
#define sorted(a) is_sorted(all(a))
#define vi vector<int>
#define vc vector<char>
#define vd vector<double>
#define vs vector<string>
#define vb vector<bool>
#define vpib vector<pair<int,bool>>
#define vpis vector<pair<int,string>>
#define vpii vector<pair<int,int>>
#define vpic vector<pair<int,char>>
#define vvi vector<vector<int>>
#define vpss vector<pair<string,string>>
#define vvc vector<vector<char>>

const ll MOD = 1e9 + 7;


void solve(){
    int n, a, b, c;
    cin>>n>>a>>b>>c;
    int count = 0;
    int aMul = n/a;
    int bMul = n/b;
    int cMul = n/c;
    //remove commons??
    int abCommon = n/lcm(a,b); //lcm multiple hi hoongay?
    int bcCommon = n/lcm(b,c);
    int acCommon = n/lcm(a,c);

    cout<<aMul+bMul+cMul-abCommon-bcCommon-acCommon+(n/lcm(a,lcm(b,c)));
} 

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    //cin>>t;
    while(t--){
        solve();
    }
}