#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int MAGIC = 1 << 18;

int main()
{
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	int tc;
	scanf("%d", &tc);
	FOR(t, 1, tc + 1) {
		int n, s1, v1, s2, v2;
		scanf("%d%d%d%d%d", &n, &s1, &v1, &s2, &v2);
		LL ans = 0;
		FOR(it, 0, 2) {
			FOR(x, 0, MAGIC) {
				if ((LL)s1 * x > n) {
					break;
				}
				int y = (n - s1 * x) / s2;
				ans = max(ans, (LL)v1 * x + (LL)v2 * y);
			}
			int xMx = n / s1;
			FOR(x, max(0, xMx - MAGIC), xMx + 1) {
				int y = (n - s1 * x) / s2;
				ans = max(ans, (LL)v1 * x + (LL)v2 * y);
			}
			swap(s1, s2);
			swap(v1, v2);
		}
		printf("Case #%d: %lld\n", t, ans);
	}
	return 0;
}