#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

ll solve(int n, vl a, vl b) {
  ll ans = n;
  rep (g, n + 1) {
    if (a[0] * g > n) break;
    rep (s, n + 1) {
      if (a[0] * g + a[1] * s > n) break;
      ll nokori = n - a[0] * g - a[1] * s;
      ll d = nokori / a[2];
      nokori -= d * a[2];
      nokori += g * b[0];
      nokori += s * b[1];
      nokori += d * b[2];
      chmax(ans, nokori);
    }
  }
  return ans;
}

bool cmp(pll a, pll b) {
  return a.first - a.second < b.first - b.second;
}

ll solve2 (int n, vector<pll> ab) {
  vl a(3), b(3);
  rep (i, 3) {
    a[i] = ab[i].first;
    b[i] = ab[i].second;
  }
  ll ans = n;

  rep (g, n + 1) {
    if (a[0] * g > n) break;
    ll nokori = n - a[0] * g;
    ll s = nokori / a[1];
    nokori -= s * a[1];
    nokori += g * b[0];
    nokori += s * b[1];
    ll d = nokori / b[2];
    nokori -= d * b[2];
    nokori += d * a[2];
    chmax(ans, nokori);
  }
  return ans;
}

ll solve1 (int n, vector<pll> ab) {
  vl a(3), b(3);
  rep (i, 3) {
    a[i] = ab[i].first;
    b[i] = ab[i].second;
  }

  ll g = n / a[0];
  ll nokori = n - a[0] * g;
  nokori += b[0] * g;

  ll ans = n;
  rep (s, nokori + 1) {
    ll temp = nokori - s * b[1];
    if (temp < 0) break;
    ll d = temp / b[2];
    temp -= d * b[2];
    temp += d * a[2];
    temp += s * a[1];
    chmax(ans, temp);
  }
  return ans;
}


int main() {
  int n;
  cin >> n;
  vl a(3), b(3);
  rep (i, 3) {
    cin >> a[i];
  }
  rep (i, 3) {
    cin >> b[i];
  }

  bool up = true, down = true;
  rep (i, 3) {
    if (a[i] > b[i]) down = false;
    if (a[i] < b[i]) up = false;
  }
  if (up and down) {
    cout << n << endl;
    return 0;
  }
  if (up) {
    cout << solve(n, b, a) << endl;
    return 0;
  }
  if (down) {
    cout << solve(n, a, b) << endl;
    return 0;
  }

  vector<pll> ab(3);
  rep (i, 3) {
    ab[i] = pll(a[i], b[i]);
  }
  sort(all(ab), cmp);
  int cnt = 0;
  rep (i, 3) {
    if (ab[i].first <= ab[i].second) cnt++;
  }
  if (cnt == 2) {
    cout << solve2(n, ab) << endl;
  }
  else {
    cout << solve1(n, ab) << endl;
  }
}


Measured memory_bytes: 384