//Bismillah #include using namespace std; #define int long long int #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 file_read(filepath) freopen(filepath, "r", stdin); #define file_write(filepath) freopen(filepath, "w", stdout); #define f first #define s second #define pb push_back #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define sorted(a) is_sorted(all(a)) #define vi vector #define vvi vector> #define vc vector #define vs vector #define pii pair #define pis pair #define psi pair #define vpii vector> #define MOD1 1000000007 #define mii map #define sz(a) a.size() void solve(){ int n; cin >> n; int a, b, c; cin >> a >> b >> c; int cnt = 0; cnt += n / a; cnt += n / b; cnt += n / c; cnt -= n / ((a * b) / __gcd(a,b)); int cc = a * b; cnt -= n / ((c * a) / __gcd(a,c)); cnt -= n / ((c * b) / __gcd(b,c)); int ab = (a * b) / __gcd(a,b); int abc = (ab * c) / __gcd(ab,c); cnt += n / abc; print(cnt) } signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; //cin >> t; while(t--){ solve(); } }