#include <iostream>
typedef long long ll;
using namespace std;
template <typename T> T gcd(T a, T b) { while (a) { b %= a; swap(a, b); } return b; }
template <typename T> T lcm(T a, T b) { return (a * b) / gcd(a,b); }
int main() {
    int n, a, b, c; cin >> n >> a >> b >> c;
    ll l = lcm<ll>(a, lcm<ll>(b, c));
    int ans = 0;
    int x = -1; if (n/l) for (int i = 0; i < l+1;   i += min(a-i%a, min(b-i%b, c-i%c))) ++ x;
    int y = -1;          for (int i = 0; i < n%l+1; i += min(a-i%a, min(b-i%b, c-i%c))) ++ y;
    cout << (n/l)*x + y << endl;
    return 0;
}