/*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, x) memset((a), (x), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(x) x & (-x)

 #define onenum(x) __builtin_popcount(x)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 const int maxn = ;

 int dp[maxn];

 int n;

 int w[];

 int main() {

     // FRead();

     Cls(dp);

     Rint(n);

     For(i, , ) {

         Rint(w[i]);

         dp[w[i]] = ;

     }

     For(i, , ) {

         For(j, w[i], n+) {

             bool flag = ;

             if(dp[j-w[i]]) {

                 dp[j] = max(dp[j], dp[j-w[i]]+);

             }

         }

     }

     printf("%d\n", dp[n]);

     RT ;

 }