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

#define ll long long
#define ull unsigned long long
#define ld long double
#define PI 3.1415926535897932384626433832795l
#define pb push_back
#define forn(i, a, n) for (int i = a; i < n; i++)
#define forrn(i, a, n) for (int i = n - 1; i >= a; i--)
#define inputArr(arr) forn(i, 0, arr.size()) cin >> arr[i]
#define inputArrRange(arr, a, b) forn(i, a, b) cin >> arr[i]
#define printArr(arr) forn(i, 0, arr.size()) cout << arr[i] << " "
#define printArrRange(arr, a, b) forn(i, a, b) cout << arr[i] << " "
#define all(ans) ans.begin(), ans.end()
#define um unordered_map
#define mp make_pair
#define here cout << "here" << endl;
#define print(ans) cout << ans << endl;
#define nl cout << endl;

typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;

void solve()
{
    ll int n;
    cin >> n;
    vl arr(3);
    cin >> arr[0] >> arr[1] >> arr[2];

    map<int, bool> mp;
    ll int ans = 0;
    forn(i, 0, 3)
    {
        int j = 1;
        while (arr[i] * j <= n)
        {
            ll curr = arr[i] * j;
            if (!mp[curr])
            {
                ans++;
                mp[curr] = 1;
            }
            j++;
        }
    }

    cout << ans << endl;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++)
    {
        solve();
    }
}