#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
vector<array<int, 4>> v;
void BaseCases() {
v.push_back({0, 0, 3, 0});
v.push_back({1, 1, 2, 0});
v.push_back({3, 0, 2, 0});
v.push_back({0, 0, 1, 2});
v.push_back({1, 1, 1, 1});
v.push_back({3, 0, 1, 1});
v.push_back({0, 3, 1, 0});
v.push_back({2, 2, 1, 0});
v.push_back({4, 1, 1, 0});
v.push_back({6, 0, 1, 0});
v.push_back({1, 1, 0, 2});
v.push_back({3, 0, 0, 2});
v.push_back({2, 2, 0, 1});
v.push_back({4, 1, 0, 1});
v.push_back({6, 0, 0, 1});
v.push_back({1, 4, 0, 0});
v.push_back({3, 3, 0, 0});
v.push_back({5, 2, 0, 0});
v.push_back({7, 1, 0, 0});
v.push_back({9, 0, 0, 0});
}
void solve(int cs) {
int a, b, c, d;
cin >> a >> b >> c >> d;
int dp[a + 1][b + 1][c + 1][d + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= a; ++i) {
for (int j = 0; j <= b; ++j) {
for (int k = 0; k <= c; ++k) {
for (int l = 0; l <= d; ++l) {
for (auto &x : v) {
if (i >= x[0] && j >= x[1] && k >= x[2] && l >= x[3]) {
dp[i][j][k][l] = max(dp[i][j][k][l], dp[i - x[0]][j - x[1]][k - x[2]][l - x[3]] + 1);
}
}
}
}
}
}
cout << "Case " << cs << ": " << dp[a][b][c][d] << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc = 1;
BaseCases();
cin >> tc;
for (int cs = 1; cs <= tc; cs++) {
solve(cs);
}
return 0;
}