#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_by_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

lint solve(lint init, vector<lint> moke_, vector<lint> require_)
{
    vector<lint> moke, require;
    REP(i, moke_.size())
    {
        if (moke_[i] > 0)
        {
            moke.push_back(moke_[i]);
            require.push_back(require_[i]);
        }
    }

    lint ret = init;
    if (moke.size() == 0) return ret;
    else if (moke.size() == 1)
    {
        lint i = init / require[0];
        mmax(ret, i * moke[0] + init);
    }
    else if (moke.size() == 3)
    {
        REP(i, init / require[0] + 1) REP(j, (init - i * require[0]) / require[1] + 1)
        {
            lint nokori = init - i * require[0] - j * require[1];
            if (nokori < 0) continue;
            lint k = nokori / require[2];
            mmax(ret, i * moke[0] + j * moke[1] + k * moke[2] + init);
        }
    }
    else if (moke.size() == 2)
    {
        REP(_, 2)
        {
            lint imax = init / require[0];
            FOR(i, max(imax - 100001, 0LL), imax + 1)
            {
                lint nokori = init - i * require[0];
                if (nokori < 0) continue;
                lint j = nokori / require[1];
                mmax(ret, i * moke[0] + j * moke[1] + init);
            }
            reverse(ALL(moke));
            reverse(ALL(require));
        }
    }
    return ret;
}

int main()
{
    lint N;
    cin >> N;
    lint g_A;
    cin >> g_A;
    lint s_A;
    cin >> s_A;
    lint b_A;
    cin >> b_A;
    lint g_B;
    cin >> g_B;
    lint s_B;
    cin >> s_B;
    lint b_B;
    cin >> b_B;

    lint tochu = solve(N, vector<lint>{g_B - g_A, s_B - s_A, b_B - b_A}, vector<lint>{g_A, s_A, b_A});
    // dbg(tochu);
    lint ret = solve(tochu, vector<lint>{-g_B + g_A, -s_B + s_A, -b_B + b_A}, vector<lint>{g_B, s_B, b_B});
    cout << ret << endl;
}


Measured memory_bytes: 256