#include <iostream>
#include <vector>
#include <algorithm>

long long N;

std::vector<long long> buff;

long long f(long long n1, long long n2)
{
    long long wk1 = n1;
    long long wk2 = n2;
    while (wk1 != wk2) {
        if (wk1 < wk2) {
            wk1 += n1;
        }
        else {
            wk2 += n2;
        }
    }
    return wk1;
}

long long f(long long *a, int s)
{
    if (s == 1) {
        return a[0];
    }
    return f(a[0], f(&a[1], s - 1));
}

long long calc(long long n)
{
    if (std::find(buff.begin(), buff.end(), n) != buff.end()) {
        return 0;
    }

    long long cnt = N / n;
    for (int i = 0; i < buff.size(); i++) {
        cnt -= N / f(buff[i], n);
    }
    buff.push_back(n);
    if (buff.size() > 2) {
        cnt += N / f(&buff[0], buff.size());
    }
    return cnt;
}

int main()
{
    long long n[3] = {0};
    long long cnt = 0;

    std::cin >> N;
    std::cin >> n[0];
    std::cin >> n[1];
    std::cin >> n[2];
    std::sort(&n[0], &n[3]);

    for (int i = 0; i < 3; i++) {
        if (n[i] == 0) {
            std::cout << -1 << std::endl;
            return 0;
        }
        if (n[i] == 1) {
            std::cout << N << std::endl;
            return 0;
        }
    }

    cnt += calc(n[0]);
    cnt += calc(n[1]);
    cnt += calc(n[2]);
    std::cout << cnt << std::endl;
    return 0;
}