#include <bits/stdc++.h>
using namespace std;
long long n, a, b, c;
int main() {
    cin >> n >> a >> b >> c;
    vector<long long> dp(n + 1, -1);
    dp[0] = 0;
    for (long long i = 1; i <= n; ++i)
    {
        if (i >= a and dp[i - a] != -1)
        {
            dp[i] = max(dp[i], dp[i - a] + 1);
        }
        if (i >= b and dp[i - b] != -1)
        {
            dp[i] = max(dp[i], dp[i - b] + 1);
        }
        if (i >= c and dp[i - c] != -1)
        {
            dp[i] = max(dp[i], dp[i - c] + 1);
        }
    }
    cout << dp[n];
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main() {
    long long n,a,b,c;
    cin>>n>>a>>b>>c;
    vector<long long> l(n + 1, -1);
    l[0]=0;
    for (long long i=1;i<=n;++i) {
        if (i>=a && l[i-a]!=-1) 
        l[i]=max(l[i],l[i-a]+1);
        if (i>=b && l[i-b]!=-1) 
        l[i]=max(l[i],l[i-b]+1);
        if (i>=c && l[i-c]!=-1) 
        l[i]=max(l[i],l[i-c]+1);
    }
    cout<<l[n];
}