import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto A = RDR.ARR;
	auto B = RDR.ARR;
	debug writeln(A, B);

	long[] f(in long[] x, in long[] order, in long[] rate)
	{
		auto y = x.dup;
		foreach (i; 0..4)
		{
			auto type = order[i];
			if (type == 0)
			{
				foreach (j; i+1..4)
				{
					auto type2 = order[j];
					y[0]     += y[type2] * rate[type2-1];
					y[type2]  = 0;
				}
				break;
			}
			y[type] += y[0] / rate[type-1];
			y[0]     = y[0] % rate[type-1];
		}
		return y;
	}

	long[4] x = [N, 0, 0, 0];
	long[][] x2;
 	foreach (i; 0..4)
	{
		foreach (j; 0..4)
		{
			if (i == j) continue;
			foreach (k; 0..4)
			{
				if (k == i || k == j) continue;
				foreach (l; 0..4)
				{
					if (l == i || l == j || l == k) continue;
					x2 ~= f(x, [i, j, k, l], A);
				}
			}
		}
	}
	//debug writeln(x2);

	long[][] x3;
	foreach (i; 0..4)
	{
		if (i == 0)
		{
			debug writeln(x2);
			foreach (e; x2)
				x3 ~= f(e, [0, 1, 2, 3], B);
			debug writeln(x3);
			continue;
		}
		foreach (j; 0..4)
		{
			if (i == j) continue;
			foreach (k; 0..4)
			{
				if (k == i || k == j) continue;
				foreach (l; 0..4)
				{
					if (l == i || l == j || l == k) continue;
					foreach (e; x2)
						x3 ~= f(e, [i, j, k, l], B);
				}
			}
		}
	}
	//debug writeln(x3);

	long[][] x4;
	foreach (i; 0..4)
	{
		foreach (j; 0..4)
		{
			if (i == j) continue;
			foreach (k; 0..4)
			{
				if (k == i || k == j) continue;
				foreach (l; 0..4)
				{
					if (l == i || l == j || l == k) continue;
					foreach (e; x3)
						x4 ~= f(e, [i, j, k, l], A);
				}
			}
		}
	}
	//debug writeln(x4);

	auto pos = x4.MIN_POS!"a[0] > b[0]"();

	writeln(x4[pos][0]);
	stdout.flush();
	debug readln();
}