#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;


int main(){
    i64 N; cin >> N;
    vector<pair<i64, i64>> AB(3);
    rep(i,3) cin >> AB[i].first >> AB[i].second;
    sort(AB.begin(), AB.end(), [](auto a, auto b){ return a.second * b.first > b.second * a.first; });
    i64 ans = 0;
    if(N >= 4000000){
        i64 t = (N - AB[1].first * AB[2].first) / AB[0].first;
        N -= t * AB[0].first;
        ans += t * AB[0].second;
    }
    vector<i64> dp(N+1, 0);
    for(auto [a,b] : AB) for(int i=a; i<=N; i++) dp[i] = max(dp[i], dp[i-a] + b);
    ans += dp[N];
    cout << ans << endl;
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;