#include <algorithm>
#include <cstdlib>
#include <iostream>
using ll = long long;
// O((A_max)^2)解法
// 入力制約: 0 <= n <= 10^13, 0 < a_i <= 10^5, 0 < b_i, floor(n / a_min) * b_max <= 2^60
ll solve(ll n, ll ap, ll bp, ll aq, ll bq, ll ar, ll br) {
	ll r = 0;
	// a_p_inv = ceil(2^62 / a_p) = floor((2^62 - 1) / a_p) + 1
	ll apinv = ((1LL << 62) - 1) / ap + 1;
	for (ll i = 0, di = n; i < ap && di >= 0; i++, di -= aq) {
		for (ll j = 0, dj = di; j < ap && dj >= 0; j++, dj -= ar) {
			// 準定数を除数とする除算の定数倍高速化
			// 0 < a_p <= 10^5, 0 <= d <= n <= 10^13 < 2^62/10^5 <= 2^62 / a_p <= ceil(2^62 / a_p) = a_p_inv < ((2^62 / a_p) + 1)
            // quot = floor((n - (i * a_q + j * a_r)) / a_p) = floor(d / a_p) = floor((d * 4) * ceil(2^62 / a_p) / 2^64) - (0 または 1)
			ll qsim = (ll)(((unsigned __int128)(dj * 4) * (unsigned __int128)apinv) >> 64);
			ll quot = qsim - (qsim * ap > dj);
			r = std::max(r, quot * bp + i * bq + j * br);
		}
	}
	return r;
}
int main() {
	ll n, a1, b1, a2, b2, a3, b3;
	std::cin >> n >> a1 >> b1 >> a2 >> b2 >> a3 >> b3;
	ll a_min = std::min({a1, a2, a3}), a_max = std::max({a1, a2, a3});
	ll b_min = std::min({b1, b2, b3}), b_max = std::max({b1, b2, b3});
	if (!(
		n >= 0 && n <= 10000000000000 && a_min > 0 && a_max <= 100000 &&
		b_min > 0 && (unsigned __int128)(n / a_min) * (unsigned __int128)b_max <= (1ULL << 60)
	)) {
		std::abort();
	}
	std::cout
		<< std::max({
			solve(n, a1, b1, a2, b2, a3, b3),
			solve(n, a2, b2, a3, b3, a1, b1),
			solve(n, a3, b3, a1, b1, a2, b2),
		})
		<< std::endl;
	return 0;
}