#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n)
{
    for (size_t i = 0; i < n; i++)
    {
        for (size_t j = 0; j < n; j++)
        {
            for (size_t k = 0; k < n; k++)
            {
                dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
            }
        }
    }
}

class UnionFind
{
public:
    vector<ll> Parent;

    UnionFind(ll N)
    {
        Parent = vector<ll>(N, -1);
    }
    ll find(ll A)
    {
        if (Parent[A] < 0)
            return A;
        return Parent[A] = find(Parent[A]);
    }

    ll size(ll A)
    {
        return -Parent[find(A)];
    }

    bool Union(ll A, ll B)
    {
        A = find(A);
        B = find(B);
        if (A == B)
        {
            return false;
        }
        if (size(A) < size(B))
            swap(A, B);

        Parent[A] += Parent[B];
        Parent[B] = A;

        return true;
    }
};

ll gcd(ll a, ll b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b)
{
    ll g = gcd(a, b);
    return a / g * b;
}

ll mulMod(ll a, ll b)
{
    return (((a % MOD) * (b % MOD)) % MOD);
}

ll powMod(ll a, ll p)
{
    if (p == 0)
    {
        return 1;
    }
    else if (p % 2 == 0)
    {
        ll half = powMod(a, p / 2);
        return mulMod(half, half);
    }
    else
    {
        return mulMod(powMod(a, p - 1), a);
    }
}

ll ceil(ll a, ll b)
{
    return (a + b - 1) / b;
}

void solve(long long N, long long g_A, long long s_A, long long b_A, long long g_B, long long s_B, long long b_B)
{
    ll dp[N + 10];
    dp[0] = 0;
    for (ll i = 1; i <= N; i++)
    {
        ll a = 0, b = 0, c = 0;
        if (i - g_A >= 0)
        {
            a = dp[i - g_A] + g_B;
        }
        if (i - s_A >= 0)
        {
            b = dp[i - s_A] + s_B;
        }
        if (i - b_A >= 0)
        {
            c = dp[i - b_A] + b_B;
        }

        dp[i] = max({i, a, b, c});
    }
    ll tmpMax = dp[N];

    ll dp2[tmpMax + 10];
    dp2[0] = 0;
    for (ll i = 1; i <= tmpMax; i++)
    {
        ll a = 0, b = 0, c = 0;
        if (i - g_B >= 0)
        {
            a = dp2[i - g_B] + g_A;
        }
        if (i - s_B >= 0)
        {
            b = dp2[i - s_B] + s_A;
        }
        if (i - b_B >= 0)
        {
            c = dp2[i - b_B] + b_A;
        }

        dp2[i] = max({i, a, b, c});
    }
    cout << dp2[tmpMax] << endl;
}

// Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
int main()
{
    long long N;
    scanf("%lld", &N);
    long long g_A;
    scanf("%lld", &g_A);
    long long s_A;
    scanf("%lld", &s_A);
    long long b_A;
    scanf("%lld", &b_A);
    long long g_B;
    scanf("%lld", &g_B);
    long long s_B;
    scanf("%lld", &s_B);
    long long b_B;
    scanf("%lld", &b_B);
    solve(N, g_A, s_A, b_A, g_B, s_B, b_B);
    return 0;
}


Measured memory_bytes: 195584