#include<iostream>
#include<math.h>
#include<iomanip>
#include <string>
#include<algorithm>
#include <vector>
using namespace std;
void fast()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
//bool isPrime(int n) {
// if (n <= 1) return false;
// for (int i = 2; i * i <= n; i++)
// if (n % i == 0) return false;
// return true;
//}
int main() {
fast();
int n;
cin >> n;
int arr[3];
for (int i = 0;i < 3;i++)
cin >> arr[i];
sort(arr, arr + 3);
int counter = 0;
while (n>=arr[0])
{
counter++;
n -= arr[0];
}
int j = 0;
while (n != 0) {
n += arr[0];
if (n == arr[1]) {
n -= arr[1];
j--;
}
else if (n == arr[2]) {
n -= arr[2];
j--;
}
j++;
}
cout << counter - j;
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPG1hdGguaD4KI2luY2x1ZGU8aW9tYW5pcD4KI2luY2x1ZGUgPHN0cmluZz4KI2luY2x1ZGU8YWxnb3JpdGhtPgojaW5jbHVkZSA8dmVjdG9yPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBmYXN0KCkKewogICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbygwKTsKICAgIGNpbi50aWUoMCk7CiAgICBjb3V0LnRpZSgwKTsKfQoKLy9ib29sIGlzUHJpbWUoaW50IG4pIHsKLy8gICAgaWYgKG4gPD0gMSkgcmV0dXJuIGZhbHNlOwovLyAgICBmb3IgKGludCBpID0gMjsgaSAqIGkgPD0gbjsgaSsrKQovLyAgICAgICAgaWYgKG4gJSBpID09IDApIHJldHVybiBmYWxzZTsKLy8gICAgcmV0dXJuIHRydWU7Ci8vfQoKaW50IG1haW4oKSB7CgogICAgZmFzdCgpOwogICAgaW50IG47CiAgICBjaW4gPj4gbjsKICAgIGludCBhcnJbM107CiAgICBmb3IgKGludCBpID0gMDtpIDwgMztpKyspCiAgICAgICAgY2luID4+IGFycltpXTsKCiAgICBzb3J0KGFyciwgYXJyICsgMyk7CiAgICBpbnQgY291bnRlciA9IDA7CgogICAgd2hpbGUgKG4+PWFyclswXSkKICAgIHsKICAgICAgICBjb3VudGVyKys7CiAgICAgICAgbiAtPSBhcnJbMF07CgogICAgfQoKICAgIGludCBqID0gMDsKICAKICAgICAgICB3aGlsZSAobiAhPSAwKSB7CiAgICAgICAgICAgIG4gKz0gYXJyWzBdOwogICAgICAgICAgICBpZiAobiA9PSBhcnJbMV0pIHsKICAgICAgICAgICAgICAgIG4gLT0gYXJyWzFdOwogICAgICAgICAgICAgICAgai0tOwogICAgICAgICAgICB9CgogICAgICAgICAgICBlbHNlIGlmIChuID09IGFyclsyXSkgewogICAgICAgICAgICAgICAgbiAtPSBhcnJbMl07CiAgICAgICAgICAgICAgICBqLS07CiAgICAgICAgICAgIH0KICAgICAgICAgICAKICAgICAgICAgICAgaisrOwogICAgICAgIH0KCiAgICBjb3V0IDw8IGNvdW50ZXIgLSBqOwoKCiAgICByZXR1cm4gMDsKfQ==