using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    struct Data
    {
        public int a, b, min, max;
        public Data(int a, int b) { this.a = a; this.b = b; min = Min(a, b); max = Max(a, b); }

    }
    int mode1(List<Data> L, int N)
    {
        int ans = 0;
        for (int i = 0; i <= N; i += L[0].min)
        {
            int p = i / L[0].min * L[0].max;
            for (int j = 0; j <= N - i; j += L[1].min)
            {
                int q = j / L[1].min * L[1].max;
                int k = N - i - j;
                int r = k / L[2].min * L[2].max;
                chmax(ref ans, p + q + r + k % L[2].min);
            }
        }
        return ans;
    }
    long mode2(List<Data> L, long N)
    {
        long ans = 0;
        for (long i = 0; i <= N; i+= L[0].min)
        {
            var p = i / L[0].min * L[0].max;
            var j = N - i;
            var q = j / L[1].min * L[1].max;
            chmax(ref ans, p + q + j % L[1].min);
        }
        return ans;
    }
    int mode3(List<Data> L, int N)
    {
        int ans = 0;
        for (int i = 0; i <= N; i += L[0].min)
        {
            int p = i / L[0].min * L[0].b;
            for (int j = 0; j <= N - i; j += L[1].min)
            {
                int q = j / L[1].min * L[1].b;
                int k = N - i - j;
                int r = k / L[2].min * L[2].b;
                chmax(ref ans, p + q + r + k % L[2].min);
            }
        }
        return ans;
    }
    void solve()
    {
        int N = cin.nextint;

        var K = new List<Data>();
        var L = new List<Data>();
        var R = new List<Data>();

        var A = cin.scanint;
        var B = cin.scanint;
        for (int i = 0; i < 3; i++)
        {
            var d = new Data(A[i], B[i]);
            if (A[i] <= B[i])
            {
                L.Add(d);
            }
            else
            {
                R.Add(d);
            }
            K.Add(d);
        }

        if (L.Count == 3)
        {
            WriteLine(mode1(L, N));
        }
        else if (R.Count == 3)
        {
            WriteLine(mode1(R, N));
        }
        else if(R.Count == 2)
        {
            var M = mode3(K, N);
            WriteLine(mode2(R, M));
        }
        else
        {
            long M = mode3(K, N);
            WriteLine(M / R[0].min * R[0].max + M % R[0].min);
        }
    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}


Measured memory_bytes: 13268