#include <bits/stdc++.h>

#pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
// #pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

using namespace std;

using i64 = int64_t;

const i64 MOD = 1e9+7;

const i64 INF = i64(1e18)+MOD;

template <typename T = i64>
struct Range{
    struct iterator{
        T value;
        const T step, last;
        const T& operator*(){return value;}
        iterator(T value, T step, T last) :
            value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),
            step(step),
            last(last)
        {
        }
        iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}
        bool operator!=(const iterator& x){return value != x.value;}
    };
    const T start, last, step;

    Range(const T start, const T last, const T step = static_cast<T>(1)) :
        start(start),
        last(last),
        step(step)
    {
    }

    Range(const T last) :
        start(0),
        last(last),
        step(1)
    {
    }

    iterator begin(){return iterator(start, step, last);}
    iterator end(){return iterator(last, step, last);}
};

template <typename F>
struct FixPoint{
    const F _f;
    FixPoint(F&& f) : _f(forward<F>(f)){}

    template<typename... Types>
    decltype(auto) operator()(Types&&... args) const{
        return _f(*this, forward<Types>(args)...);
    }
};

template <typename F>
static decltype(auto) makeRec(F&& f){
    return FixPoint<F>(forward<F>(f));
}

template <typename T, T Value = T()>
vector<T> makeVector(size_t x){
    return vector<T>(x, T(Value));
}

template <typename T, T Value = T(), typename... Types>
auto makeVector(size_t x, Types... args){
    return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));
}

template <typename T = i64>
bool chmax(T& a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template <typename T = i64>
bool chmin(T& a, T b){
    if(a > b){
        a = b;
        return true;
    }
    return false;
}

#define dump(x) fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); clog << "value = " << x << endl;

#define vecdump(x) fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); _dump_macro(x);

void _dump(int, string& x){
    clog << x << endl;
}

template <typename T>
void _dump(bool, T& x){
    clog << x << " ";
}

template <typename T, typename U = typename T::iterator>
void _dump(int, T& x){

    for(auto& elm : x)
        _dump(0, elm);

    clog << endl;
}

template <typename T>
void _dump_macro(T& x){
    _dump(0, x);
}

void _input(int, string& x){
    cin >> x;
}

template <typename T>
void _input(bool, T& x){
    cin >> x;
}

template <typename T, typename U = typename T::iterator>
void _input(int, T& x){

    for(auto& elm : x)
        _input(0, elm);
}

template <typename T>
void input_single(T& x){
    _input(0, x);
}

auto input(){}

template <typename T, typename... Types>
void input(T& value, Types&&... args){
    input_single(value);
    input(forward<Types>(args)...);
};

void _pararell_input(size_t){}

template <typename T, typename... Types>
void _pararell_input(size_t index, T& value, Types&&... args){
    input(value[index]);
    _pararell_input(index, forward<Types>(args)...);
}

template <typename... Types>
void pararell_input(size_t count, Types&&... args){
    for(const auto& i : Range<>(count))
        _pararell_input(i, forward<Types>(args)...);
}


bool solve(){

    int n;
    input(n);
    vector<vector<i64>> v(3, vector<i64>(2));
    pararell_input(2, v[0], v[1], v[2]);
    vector<vector<i64>> dp(4, vector<i64>(n + 1, -INF));
    dp[0][n] = n;
    for(i64 i = 0; i < 3; ++i){
        for(i64 j = 0; j <= n; ++j){
            if(dp[i][j] == -INF)
                continue;
            for(i64 k = 0; j - (v[i][0] * k) >= 0; ++k){
                chmax(dp[i + 1][j - (v[i][0] * k)], dp[i][j] + (v[i][1] - v[i][0]) * k);
            }
        }
    }

    bool fl = true;
    for(int i = 0; i < 3; ++i)
        fl &= (v[i][0] >= v[i][1]);
    i64 b = *max_element(dp.back().begin(), dp.back().end());

    for(int i = 0; i < 3; ++i)
        swap(v[i][0], v[i][1]);

    if(fl){
        dp.assign(4, vector<i64>(b + 1, -INF));
        assert(b <= 10000);
        dp[0][b] = b;

        for(i64 i = 0; i < 3; ++i){
            for(i64 j = 0; j <= b; ++j){
                if(dp[i][j] == -INF)
                    continue;
                for(i64 k = 0; j - (v[i][0] * k) >= 0; ++k){
                    chmax(dp[i + 1][j - (v[i][0] * k)], dp[i][j] + (v[i][1] - v[i][0]) * k);
                }
            }
        }

        cout << *max_element(dp.back().begin(), dp.back().end()) << endl;

    }else{
        vector<vector<i64>> w;
        for(int i = 0; i < 3; ++i)
            if(v[i][0] < v[i][1]){
                vector<i64> t{v[i][0], v[i][1]};
                w.emplace_back(t);
            }
        if(w.empty()){
            cout << b << endl;
            return 0;
        }else if(w.size() == 1){
            i64 bu = b / w[0][0];
            b += (w[0][1] - w[0][0]) * bu;
            cout << b << endl;
            return 0;
        }
        i64 ret = -INF;
        assert(w.size() == 2);
        for(int i = 0; b - (w[0][0] * i) >= 0; ++i){
            int j = (b - (w[0][0] * i)) / w[1][0];
            i64 ans = b;
            ans += i * (w[0][1] - w[0][0]);
            ans += j * (w[1][1] - w[1][0]);
            chmax(ret, ans);
        }
        cout << ret << endl;
    }

    return false;
}

signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    solve();
}



Measured memory_bytes: 640