#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod



signed main(){

    int N; cin >> N;
    mat rate(2, vec(3));
    REP(a, 2) cin >> rate[a];

    mat use(2);
    REP(i, 3){
        if(rate[0][i] < rate[1][i]) use[0].pb(i);
        if(rate[0][i] > rate[1][i]) use[1].pb(i);
    }

    int a = 0;
    if(SZ(use[a])){
        int n = SZ(use[a]);
        if(n == 1){
            N += N / rate[a][use[a][0]] * (rate[1 - a][use[a][0]] - rate[a][use[a][0]]);
        }else if(n == 2){
            int M = 0;
            REP(i, N + 1){
                if(rate[a][use[a][0]] * i > N) break;
                int j = (N - rate[a][use[a][0]] * i) / rate[a][use[a][1]];
                int tmp = N + i * (rate[1 - a][use[a][0]] - rate[a][use[a][0]]) + j * (rate[1 - a][use[a][1]] - rate[a][use[a][1]]);
                Max(M, tmp);
            }
            N = M;
        }else{
            int M = 0;
            REP(i, N + 1) REP(j, N + 1 - i){
                if(rate[a][use[a][0]] * i + rate[a][use[a][1]] * j > N) break;
                int k = (N - rate[a][use[a][0]] * i - rate[a][use[a][1]] * j) / rate[a][use[a][2]];
                int tmp = N + i * (rate[1 - a][use[a][0]] - rate[a][use[a][0]]) + j * (rate[1 - a][use[a][1]] - rate[a][use[a][1]]) + k * (rate[1 - a][use[a][2]] - rate[a][use[a][2]]);
                Max(M, tmp);
            }
            N = M;
        }
    }

    a = 1;
    if(SZ(use[a])){
        int n = SZ(use[a]);
        if(n == 1){
            N += N / rate[a][use[a][0]] * (rate[1 - a][use[a][0]] - rate[a][use[a][0]]);
        }else if(n == 2){
            int M = 0;
            REP(i, N + 1){
                if(rate[a][use[a][0]] * i > N) break;
                int j = (N - rate[a][use[a][0]] * i) / rate[a][use[a][1]];
                int tmp = N + i * (rate[1 - a][use[a][0]] - rate[a][use[a][0]]) + j * (rate[1 - a][use[a][1]] - rate[a][use[a][1]]);
                Max(M, tmp);
            }
            N = M;
        }else{
            int M = 0;
            REP(i, N + 1) REP(j, N + 1 - i){
                if(rate[a][use[a][0]] * i + rate[a][use[a][1]] * j > N) break;
                int k = (N - rate[a][use[a][0]] * i - rate[a][use[a][1]] * j) / rate[a][use[a][2]];
                int tmp = N + i * (rate[1 - a][use[a][0]] - rate[a][use[a][0]]) + j * (rate[1 - a][use[a][1]] - rate[a][use[a][1]]) + k * (rate[1 - a][use[a][2]] - rate[a][use[a][2]]);
                Max(M, tmp);
            }
            N = M;
        }
    }

    Out(N);

    return 0;
}


Measured memory_bytes: 256