import sys, time, random
from collections import deque, Counter, defaultdict
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
from math import gcd
n = ii()

AB = [tuple(li()) for _ in range(3)]
import itertools

ans = 0 
for v in itertools.permutations(range(3)):
    a1, b1 = AB[v[0]]
    a2, b2 = AB[v[1]]
    a3, b3 = AB[v[2]]
    for i in range(3000):
        for j in range(3000):
            if a1 * i + a2 * j > n:
                continue
            k = (n - a1 * i - a2 * j) // a3
            ans = max(ans, b1 * i + b2 * j + b3 * k)
print(ans)