using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using Library;

namespace Program
{
    public static class ProblemF
    {
        static bool SAIKI = false;
        static public int numberOfRandomCases = 0;
        static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
        {
        }
        static public void Solve()
        {
            var N = NN;
            var gA = NN;
            var sA = NN;
            var bA = NN;
            var gB = NN;
            var sB = NN;
            var bB = NN;
            if (gA >= gB && sA >= sB && bA >= bB)
            {
                var origN = N;
                for (var i = 0; i <= origN; i++)
                {
                    for (var j = 0; j <= origN; j++)
                    {
                        if (i + j > origN) break;
                        var g = i / gB;
                        var s = j / sB;
                        var nextN = origN - i - j;
                        var b = nextN / bB;
                        nextN -= b * bB;
                        nextN += g * gA + s * sA + b * bA;
                        N = Max(N, nextN);
                    }
                }
            }
            else if (gA >= gB && sA >= sB && bA < bB)
            {
                var b = N / bA;
                N -= b * bA;
                N += b * bB;
                var origN = N;
                for (var i = 0; i <= origN; i++)
                {
                    var nextN = origN - i;
                    var g = i / gB;
                    var s = nextN / sB;
                    nextN -= s * sB;
                    nextN += g * gA + s * sA;
                    N = Max(N, nextN);
                }
            }
            else if (gA >= gB && sA < sB && bA >= bB)
            {
                var s = N / sA;
                N -= s * sA;
                N += s * sB;
                var origN = N;
                for (var i = 0; i <= origN; i++)
                {
                    var nextN = origN - i;
                    var g = i / gB;
                    var b = nextN / bB;
                    nextN -= b * bB;
                    nextN += g * gA + b * bA;
                    N = Max(N, nextN);
                }
            }
            else if (gA >= gB && sA < sB && bA < bB)
            {
                var origN = N;
                for (var i = 0; i <= origN; i++)
                {
                    var nextN = origN - i;
                    var b = i / bA;
                    var s = nextN / sA;
                    nextN -= s * sA;
                    nextN += b * bB + s * sB;
                    N = Max(N, nextN);
                }
                var g = N / gB;
                N -= g * gB;
                N += g * gA;
            }
            else if (gA < gB && sA >= sB && bA >= bB)
            {
                var g = N / gA;
                N -= g * gA;
                N += g * gB;
                var origN = N;
                for (var i = 0; i <= origN; i++)
                {
                    var nextN = origN - i;
                    var b = i / bB;
                    var s = nextN / sB;
                    nextN -= s * sB;
                    nextN += s * sA + b * bA;
                    N = Max(N, nextN);
                }
            }
            else if (gA < gB && sA >= sB && bA < bB)
            {
                var origN = N;
                for (var i = 0; i <= origN; i++)
                {
                    var nextN = origN - i;
                    var g = i / gA;
                    var b = nextN / bA;
                    nextN -= b * bA;
                    nextN += g * gB + b * bB;
                    N = Max(N, nextN);
                }
                var s = N / sB;
                N -= s * sB;
                N += s * sA;
            }
            else if (gA < gB && sA < sB && bA >= bB)
            {
                var origN = N;
                for (var i = 0; i <= origN; i++)
                {
                    var nextN = origN - i;
                    var g = i / gA;
                    var s = nextN / sA;
                    nextN -= s * sA;
                    nextN += g * gB + s * sB;
                    N = Max(N, nextN);
                }
                var b = N / bB;
                N -= b * bB;
                N += b * bA;
            }
            else if (gA < gB && sA < sB && bA < bB)
            {
                var origN = N;
                for (var i = 0; i <= origN; i++)
                {
                    for (var j = 0; j <= origN; j++)
                    {
                        if (i + j > origN) break;
                        var g = i / gA;
                        var s = j / sA;
                        var nextN = origN - i - j;
                        var b = nextN / bA;
                        nextN -= b * bA;
                        nextN += g * gB + s * sB + b * bB;
                        N = Max(N, nextN);
                    }
                }
            }
            Console.WriteLine(N);
        }
        class Printer : StreamWriter
        {
            public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
            public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
            public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
        }
        static LIB_FastIO fastio = new LIB_FastIODebug();
        static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
        static long NN => fastio.Long();
        static double ND => fastio.Double();
        static string NS => fastio.Scan();
        static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
        static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
        static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
        static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
        static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
        static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
        static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
        static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
        static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
        static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
        static IEnumerator<uint> _xsi = _xsc();
        static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
    }
}
namespace Library {
    class LIB_FastIO
    {
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIO() { str = Console.OpenStandardInput(); }
        readonly Stream str;
        readonly byte[] buf = new byte[1024];
        int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream
        {
            [MethodImpl(MethodImplOptions.AggressiveInlining)]
            get { return isEof; }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        byte read()
        {
            if (isEof) throw new EndOfStreamException();
            if (ptr >= len)
            {
                ptr = 0;
                if ((len = str.Read(buf, 0, 1024)) <= 0)
                {
                    isEof = true;
                    return 0;
                }
            }
            return buf[ptr++];
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        char Char()
        {
            byte b = 0;
            do b = read();
            while (b < 33 || 126 < b);
            return (char)b;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public long Long()
        {
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
    class LIB_FastIODebug : LIB_FastIO
    {
        Queue<string> param = new Queue<string>();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIODebug() { }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override string Scan() => NextString();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override long Long() => long.Parse(NextString());
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override double Double() => double.Parse(NextString());
    }
}


Measured memory_bytes: 23768