#pragma GCC optimize("O3")

#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl

#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define PER(i,a,b) for(int i=(a);i>(b);i++)
#define SZ(a) int((a).size())
#define ALL(a) (a).begin(), (a).end()
#define MS(s, n) memset(s, n, sizeof(s))
#define IN(t, x) (t.find(x) != t.end())
#define PB push_back
#define MP make_pair
#define VI vector<int>

typedef vector<pair<int, int>> VPII;
typedef pair<int, int> PII;
typedef long long ll;
typedef unsigned long long ull;
const int MOD = (int) 1e9 + 7;

ll dp[25000001];

int main() {
    int n;
    vector<ll> A;
    vector<ll> B;
    cin >> n;
    ll tmp;
    REP(i, 0, 3) { cin >> tmp; A.PB(tmp); }
    REP(i, 0, 3) { cin >> tmp; B.PB(tmp); }

//    dbg(A);
//    dbg(B);

//    ll aToB[n+1];
//    MS(aToB, 0);
    REP(j, 1, n+1) { dp[j] = j; }
    REP(i, 1, 4) {
        ll lose = A[i-1];
        ll gain = B[i-1];
        REP(j, 1, n+1) {
            dp[j] = max(dp[j], dp[j-1] + 1);
            if (j - lose >= 0) {
                dp[j] = max(dp[j-lose] + gain, dp[j]);
            }
        }
    }
//    REP(i,0,4) {
//        REP (j, 0, n+1) {
//            cout << aToB[i][j] << ' ';
//        }
//        cout << '\n';
//    }
//    dbg(aToB[3]);
    ll maxAtB = dp[n];
//    cout << maxAtB << endl;
//    ll bToA[maxAtB+1];
//    MS(bToA, 0);
    REP(j, 0, maxAtB+1) dp[j] = j;
    REP(i, 1, 4) {
        ll lose = B[i-1];
        ll gain = A[i-1];
        REP(j, 1, maxAtB+1) {
            dp[j] = max(dp[j], dp[j-1] + 1);
            if (j - lose >= 0) {
                dp[j] = max(dp[j-lose] + gain, dp[j]);
            }
        }
    }
//    dbg(aToB);
//    dbg(bToA);
//    cout << "here\n";
    cout << dp[maxAtB] << "\n";

    return 0;
}

Measured memory_bytes: 195584