#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

//#define int long long
//using ll = boost::multiprecision::cpp_int;
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=1<<31-1=2147483647
constexpr ll INF = (ll)1e18;//1<<63-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4]={1,0,-1,0};
constexpr int dy[4]={0,1,0,-1};
#ifdef LOCAL_ENV
	#define debug(var) std::cout<<#var" = "<<var<<std::endl
#else
	#define debug(var)
#endif
#define p(var) std::cout<<var<<std::endl
#define PI (acos(-1))
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(a) (a).begin(), (a).end()
#define pb push_back
inline bool isnatural(double a) { return a>=0 && ceil(a)==floor(a); }
template<typename T> inline T power(T x, T n){ return n ? power(x*x%MOD,n/2)*(n%2?x:1)%MOD : 1; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2>inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2>inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
	for (int i = 0, len = v.size(); i < len; ++i){
		s << v[i]; if (i < len - 1) s << "\t";
	}
	return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
	for (int i = 0, len = vv.size(); i < len; ++i){
		s << vv[i] << endl;
	}
	return s;
}
template<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {
	s << "{" << endl;
	for (typeof(m.begin()) itr = m.begin(); itr != m.end(); ++itr){
		s << "\t" << (*itr).first << " : " << (*itr).second << endl;
	}
	s << "}" << endl;
	return s;
}

/*-----8<-----8<-----*/

class Item{
public:
	ll value;
	ll weight;
	Item():value(0),weight(0){}
	Item(ll value,ll weight):value(value),weight(weight){}
	bool operator<(const Item &another) const
	{
		return ((double)value/weight) < ((double)another.value/another.weight);
	};
};

ll N,W;
ll gA, sA, bA;
ll gB, sB, bB;

void input() {
	scanf("%lld", &W);
	scanf("%lld%lld%lld", &gA, &sA, &bA);
	scanf("%lld%lld%lld", &gB, &sB, &bB);
}

void solve() {
	vector<Item> items;
	items.push_back(Item(gB-gA,gA));
	items.push_back(Item(sB-sA,sA));
	items.push_back(Item(bB-bA,bA));
	ll N=3;
	vector<vector<ll>> dp(N+1, vector<ll>(W+1,0));
	rep(n,N){
		rep(w,W+1){
			if(w < items[n].weight){
				dp[n+1][w]=dp[n][w];
			}else{
				dp[n+1][w]=max(dp[n][w], dp[n+1][w-items[n].weight]+items[n].value);
			}
		}
	}

	//
	debug(dp);
	W=dp[N][W]+W;
	vector<vector<ll>> dp2(N+1, vector<ll>(W+1,0));
	items.resize(0);
	items.push_back(Item(gA-gB,gB));
	items.push_back(Item(sA-sB,sB));
	items.push_back(Item(bA-bB,bB));
	rep(n,N){
		rep(w,W+1){
			if(w < items[n].weight){
				dp2[n+1][w]=dp2[n][w];
			}else{
				dp2[n+1][w]=max(dp2[n][w], dp2[n+1][w-items[n].weight]+items[n].value);
			}
		}
	}
	debug(dp2);
	printf("%lld\n", dp2[N][W]+W);
}

signed main() {
	input();
	solve();
	return 0;
}


Measured memory_bytes: 977024