#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    ll n; cin >> n;
    vector<ll> a(3), b(3);
    for(int i = 0; i < 3; i++) cin >> a[i] >> b[i];
    ll ans = 0;
    for(int i = 0; i < 3; i++){
        int i0, i1;
        if(i == 0){
            i0 = 1; i1 = 2;
        }else if(i == 1){
            i0 = 0; i1 = 2;
        }else{
            i0 = 0; i1 = 1;
        }
        for(ll x = 0; x <= 2000; x++){
            for(ll y = 0; y <= 2000; y++){
                ll c = x*a[i0]+y*a[i1];
                if(c >= n) break;
                ll rem = n-c;
                ll z = rem/a[i];
                chmax(ans, x*b[i0]+y*b[i1]+z*b[i]);
            }
        }
    }
    cout << ans << endl;
}