using System;
using System.Linq;
using System.Collections.Generic;
using System.Diagnostics;
using Debug = System.Diagnostics.Trace;
using SB = System.Text.StringBuilder;
using static System.Math;

using Number = System.Int64;
using static System.Numerics.BigInteger;
namespace Program {
	public class Solver {
		Random rnd = new Random(0);
		public void Solve() {
			var X = ri;
			var a = Enumerate(3, x => ri);
			var b = Enumerate(3, x => ri);
			var dp = new long[X + 1];
			for (int k = 0; k < 3; k++) {
				for (int i = 0; i + a[k] <= X; i++)
					dp[i + a[k]] = Max(dp[i + a[k]], dp[i] + b[k]);
			}
			var max = 0L;
			for (int i = 0; i <= X; i++)
				max = Max(max, X - i + dp[i]);

			dp = new long[max + 1];
			Swap(ref a, ref b);
			for (int k = 0; k < 3; k++) {
				for (int i = 0; i + a[k] <= max; i++)
					dp[i + a[k]] = Max(dp[i + a[k]], dp[i] + b[k]);
			}
			var ans = 0L;
			for (int i = 0; i <= max; i++)
				ans = Max(ans, max - i + dp[i]);
			Console.WriteLine(ans);


		}
		const long INF = 1L << 60;
		static int[] dx = { -1, 0, 1, 0 };
		static int[] dy = { 0, 1, 0, -1 };
		int ri { get { return sc.Integer(); } }
		long rl { get { return sc.Long(); } }
		double rd { get { return sc.Double(); } }
		string rs { get { return sc.Scan(); } }
		public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
		static T[] Enumerate<T>(int n, Func<int, T> f) {
			var a = new T[n]; for (int i = 0; i < a.Length; ++i) a[i] = f(i); return a;
		}
		static T[][] Enumerate<T>(int n, int m, Func<int, int, T> f) {
			return Enumerate(n, x => Enumerate(m, y => f(x, y)));
		}
		static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
	}
}

#region main
static class Ex {
	static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
	static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
		return string.Join(st, ie);
	}
	static public void Main() {
		Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
		var solver = new Program.Solver();
		//* 
		// var t = new System.Threading.Thread(solver.Solve, 200000000);
		// t.Start();
		// t.Join();
		//*/
		solver.Solve();
		Console.Out.Flush();
	}
}
#endregion
#region Ex
namespace Program.IO {
	using System.IO;
	using System.Text;
	using System.Globalization;

	public class Printer : StreamWriter {
		public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
		public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
	}

	public class StreamScanner {
		public StreamScanner(Stream stream) { str = stream; }

		public readonly Stream str;
		private readonly byte[] buf = new byte[1024];
		private int len, ptr;
		public bool isEof = false;
		public bool IsEndOfStream { get { return isEof; } }

		private byte read() {
			if (isEof) return 0;
			if (ptr >= len) {
				ptr = 0;
				if ((len = str.Read(buf, 0, 1024)) <= 0) {
					isEof = true;
					return 0;
				}
			}
			return buf[ptr++];
		}

		public char Char() {
			byte b = 0;
			do b = read(); while ((b < 33 || 126 < b) && !isEof);
			return (char)b;
		}
		public string Scan() {
			var sb = new StringBuilder();
			for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
			return sb.ToString();
		}
		public string ScanLine() {
			var sb = new StringBuilder();
			for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
			return sb.ToString();
		}
		public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
		public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
		public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
	}
}

#endregion

#region next_permutation
static public partial class MathEx {

	static public bool NextPermutation<T>(this T[] array, int first, int last) where T : IComparable<T> {
		if (first == last)
			return false;
		var i = last;
		if (--i == first)
			return false;
		while (true) {
			var ii = i--;
			if (array[i].CompareTo(array[ii]) < 0) {
				var j = last;
				while (array[i].CompareTo(array[--j]) >= 0) { }
				var temp = array[i];
				array[i] = array[j];
				array[j] = temp;
				Array.Reverse(array, ii, last - ii);
				return true;
			}
			if (i == first) {
				Array.Reverse(array, first, last - first);
				return false;
			}
		}
	}

}
#endregion


Measured memory_bytes: 206304