分类枚举
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define LL long long
#define mod 1000000007
#define INF 1000000007
#define eps 1e-5
#define PI 3.1415926535898
using namespace std;
//-------------------------CHC------------------------------//
const int maxt = 65536;
int main() {
int t, kase = 1;
scanf("%d", &t);
while (t--) {
LL vol, a1, b1, a2, b2;
scanf("%lld%lld%lld%lld%lld", &vol, &a1, &b1, &a2, &b2);
LL tag = min(vol / a1, vol / a2);
LL ans = 0, val;
if (tag < maxt) {
if (vol / a1 < vol / a2) {
for (int i = 0; i <= tag; ++i) {
val = i*b1 + (vol - i*a1) / a2*b2;
ans = max(ans, val);
}
}
else {
for (int i = 0; i <= tag; ++i) {
val = i*b2 + (vol - i*a2) / a1*b1;
ans = max(ans, val);
}
}
}
else {
if (a2*b1 > a1*b2) {
for (int i = 0; i < a1; ++i) {
val = i*b2 + (vol - i * a2) / a1*b1;
ans = max(ans, val);
}
}
else {
for (int i = 0; i < a2; ++i) {
val = i*b1 + (vol - i * a1) / a2*b2;
ans = max(ans, val);
}
}
}
printf("Case #%d: %lld\n", kase++, ans);
}
return 0;
}