#include <bits/stdc++.h>
using namespace std;

#define int long long

typedef vector<int> vi;
typedef pair<int, int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define popcount __builtin_popcountll
int const MOD = 1e9 + 7;

void swapp(int &a, int &b) {
    a = a ^ b;
    b = a ^ b;
    a = a ^ b;
}

int mul(int a, int b) {
    if (log10l(a) + log10l(b) > 18.3) return 3e18;
    return a * b;
}

#define forn(i, a, b) for (int i = a; i < b; i++)

bool comp(pair<int, int> a, pair<int, int> b) {
    if (a.first == b.first) {
        return a.second > b.second;
    }
    return a.first < b.first;
}
int lcm(int a,int b){
    return (a *b)/__gcd(a,b);
}
void solve() {
    int n;
    cin>>n;
    int a,b,c;
    cin>>a>>b>>c;
    int m1 = n/a;
    int m2 = n/b;
    int m3 = n/c;
    int m1a = n / lcm(a,b);
    int m1b = n / lcm(b,c);
    int m1c = n / lcm(a,c);
    int m1a2 = n/lcm(c,lcm(a,b));
    cout<<m1 + m2 + m3 - m1a - m1b - m1c + m1a2;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    // cin >> t;
    forn(i,0,t){
        solve();
    }
    return 0;
}