#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  int a, b, c, d;
  cin >> a >> b >> c >> d;
  int res = 0;
  int m = min({a, b, c, d});
  res += m;
  a -= m, b -= m, c -= m, d -= m;
  while (c && min(a, b) > 1) {
    c -= 1, b -= 2, a -= 2;
    res += 1;
  }
  while (c > 1 && min(a, b)) {
    res += 1;
    c -= 2, a -= 1, b -= 1;
  }
  while (c && b > 2) {
    res += 1, c -= 1, b -= 2;
  }
  while (a && b > 3) {
    res += 1;
    a -= 1, b -= 4;
  }
  while (a > 2 && b > 2) {
    res += 1;
    a -= 3, b -= 3;
  }
  while (a > 4 && b > 1) {
    res += 1;
    a -= 5, b -= 2;
  }
  while (b && a > 6) {
    res += 1;
    b -= 1, a -= 7;
  }
  int k = c + min(a, b);
  res += k / 3;
  a -= min(a, b);
  res += a / 9;

  cout << "Case " << cs << ": " << res << "\n";


}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}