#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define VI vector<int>
#define VII vector<VI>
#define VL vector<long>
#define VLL vector<VL>
#define VD vector<double>
#define VDD vector<VD>
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define EP emplace_back
#define FORE(a,b) for(auto &&a:b)

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF=1e9;
const int MOD=INF+7;

#define int long

inline void DEB(vector<int> v){
    FORE(el,v) cout<<el<<" ";
    cout<<endl;
}

long gcd(long a,long b){
    if(a<b) swap(a,b);
    long ret=1;
    while(b){ret=b;b=a%b;a=ret;}
    return ret;
}

int lcm(int a,int b){
    return (a*b)/gcd(a,b);
}

signed main (void){
    int N,a,b,c;
    cin>>N>>a>>b>>c;
    int ab,bc,ca,abc;
    ab=lcm(a,b);
    bc=lcm(b,c);
    ca=lcm(c,a);
    abc=lcm(ab,bc);
    //DEB({ab,bc,ca,abc});
    a=N/a; b=N/b; c=N/c;
    ab=N/ab; bc=N/bc; ca=N/ca;
    abc=N/abc;
    int cnt=a+b+c;
    cnt-=(ab+bc+ca);
    cnt+=abc;
    //DEB({a,b,c,ab,bc,ca,abc});
    cout<<cnt<<endl;
}