#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define SORT(c) sort((c).begin(),(c).end())
#define ve vector
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
 
using ll = long long;
const ll INF = LLONG_MAX - 100;
ll mod = 1e9 + 7;
int dx[] = {-1,0,1,0}, dy[] = {0,1,0,-1};
vector<ll> prime;

class fact {
public:
	int fmod = 1e9+7;
	vector<int> fac, inv;
	fact (int n, int Mod = 1e9+7) {
		fmod = Mod;
		fac = vector<int>(n,0);
		inv = vector<int>(n,0);
		fac[0] = 1; for (int i = 1; i < n; i++) fac[i] = fac[i-1] * i % fmod;
		for (int i = 0;i < n;i++) inv[i] = fact::POW(fac[i],fmod-2);
	}
	ll nCr(ll n, ll r) {return (fac[n] * inv[r] % fmod) * inv[n-r] % fmod;}
	ll POW(ll a, ll b) {ll c = 1; while (b > 0) {if (b & 1) {c = a * c%fmod;}a = a * a%fmod; b >>= 1;}return c;}
};
 
template <class T = ll> T in() {T x; cin >> x; return (x);}
void DEBUG(vector<int> a) {for(int i=0;i<a.size();i++)cout<<a[i]<<" ";cout<<endl;}
void EMP(int x) {cout<<"!!!"<<x<<"!!!"<<endl;}
ll GCD(ll a, ll b) {ll c; while (b != 0) {c = a % b; a = b; b = c;}return a;}
ll LCM(ll a, ll b) {return a * b / GCD(a, b);}
ll POW(ll a, ll b) {ll c = 1; while (b > 0) {if (b & 1) {c = a * c%mod;}a = a * a%mod; b >>= 1;}return c;}
void PRI(ll n) {bool a[n + 1LL]; for (int i = 0; i < n + 1LL; i++) {a[i] = 1LL;}for (int i = 2; i < n + 1LL; i++) {if (a[i]) {prime.pb(i); ll b = i; while (b <= n) {a[b] = 0; b += i;}}}}
template <typename T> T chmin(T& a, T b) {if(a>b)a=b;return a;}
template <typename T> T chmax(T& a, T b) {if(a<b)a=b;return b;}
bool isSqrt(ll a) {return pow(sqrt(a),2) == a ? 1 : 0;}
void YesNo(bool a) {if (a) cout << "Yes"; else cout << "No"; cout << endl;}
void yesno(bool a) {if (a) cout << "yes"; else cout << "no"; cout << endl;}
void YESNO(bool a) {if (a) cout << "YES"; else cout << "NO"; cout << endl;}

bool solve() {
	int n; cin >> n;
    pair<int,int> cos[3];//B-A,A
    int g[2],s[2],b[2];
    REP (i,2) {
        cin >> g[i] >> s[i] >> b[i];
    }
    cos[0]={g[1]-g[0],g[0]};
    cos[1]={s[1]-s[0],s[0]};
    cos[2]={b[1]-b[0],b[0]};
    sort(cos,cos+3);
    int next = 0;
    if (cos[0].first >= 0 || cos[2].first <= 0) {
        if (cos[2].first <= 0) {
            swap(g[0],g[1]);
            swap(s[0],s[1]);
            swap(b[0],b[1]);
        }
        REP (i,n / g[0] + 10) {
            REP (j,n / s[0] + 10) {
                int tmp = n;
                if (i * g[0] + j * s[0] > n) continue;
                tmp += (g[1]-g[0])*i + (s[1]-s[0])*j;
                if (b[0] < b[1]) {
                    tmp += ((n - (i*g[0]+j*s[0])) / b[0]) * (b[1] - b[0]);
                } else {
                    // tmp += n - (i*g[0]+j*s[0]);
                }
                chmax(next,tmp);
            }
        }
        cout << next << endl;
    } else if (cos[1].first >= 0) {
        //ABB
        REP (i,n / g[0] + 10) {
            REP (j,n / s[0] + 10) {
                int tmp = n;
                if (i * g[0] + j * s[0] > n) continue;
                tmp += (g[1]-g[0])*i + (s[1]-s[0])*j;
                if (b[0] < b[1]) {
                    tmp += ((n - (i*g[0]+j*s[0])) / b[0]) * (b[1] - b[0]);
                } else {
                    // tmp += n - (i*g[0]+j*s[0]);
                }
                chmax(next,tmp);
            }
        }
        next += next/(cos[0].first+cos[0].second) * (-cos[0].first);
        cout << next << endl;
    } else {
        //AAB
        //最大ケース5000*5000をcos0とcos1で水増し
        //cos0を決めるとcos1も決まる
        REP (i,n / g[0] + 10) {
            REP (j,n / s[0] + 10) {
                int tmp = n;
                if (i * g[0] + j * s[0] > n) continue;
                tmp += (g[1]-g[0])*i + (s[1]-s[0])*j;
                if (b[0] < b[1]) {
                    tmp += ((n - (i*g[0]+j*s[0])) / b[0]) * (b[1] - b[0]);
                } else {
                    // tmp += n - (i*g[0]+j*s[0]);
                }
                chmax(next,tmp);
            }
        }
        int a1 = cos[0].first+cos[0].second, a2 = cos[1].first+cos[1].second, d1 = -cos[0].first, d2 = -cos[1].first;
        int now = next;
        REP (i, next / a1 + 10) {
            // cout << 1 << endl;
            if (a1 * i > next) continue;
            int tmp = next + i * d1;
            tmp += (next-a1*i) / a2 * d2;
            chmax(now,tmp);
        }
        cout << now << endl;
    }
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	solve();
}


Measured memory_bytes: 256