// Problem: No.2386 Udon Coupon (Easy)No.2386 乌冬面优惠券 （简易）
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2386
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+10;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
ll ksm(ll n,ll p,int mod){
	int ans=1;
	while(p){
		if(p&1) ans=(ans*n)%mod;
		n=(n*n)%mod;p>>=1;
	}
	return ans;
}
ll inv(ll b,ll c=mod) {return ksm(b,c-2,c);}
class Num{
public:
	ll num;
	Num(ll x) {num=(x%mod+mod)%mod;}
	Num operator+(Num p) {return Num(num+p.num);}
	Num operator-(Num p) {return Num(num-p.num);}
	Num operator*(Num p) {return Num(num*p.num);}
	Num operator/(Num p) {return Num(num*inv(p.num));}
	Num operator=(Num p) {this->num=p.num;return *this;}
	friend ll get(Num p) {return p.num;}
};
ll a[3],b[3];
void solve() {
	ll n;
	cin>>n;
	for(int i=0;i<3;i++) {
		cin>>a[i]>>b[i];
	}
	if (a[1] * b[0] < a[0] * b[1]) {
		swap(a[0], a[1]);
		swap(b[0], b[1]);
	}
	if (a[2] * b[0] < a[0] * b[2]) {
		swap(a[0], a[2]);
		swap(b[0], b[2]);
	}
	ll mx=0;
	for(ll j=0;j<a[0];j++) {
		for(ll k=0;k<a[0];k++) {
			ll i=(n-j*a[1]-k*a[2])/a[0];
			if(i>=0&&i*a[0]+j*a[1]+k*a[2]<=n) {
				mx=max(mx,i*b[0]+j*b[1]+k*b[2]);
			}
		}
	}
	cout<<mx<<endl;
}
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T=1;
    //cin>>T;
    while(T--) {
    	solve();
    }
    return 0;
}