#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

const int maxn =  + ;

int n;

struct node {

    int L, W, H;

    node(int LL, int WW, int HH) : L(LL), W(WW), H(HH) {}

    node() {}

    bool operator < (const struct node & rhs) const {

        if (L != rhs.L) return L > rhs.L;

        else if (W != rhs.W) return W > rhs.W;

        else return H > rhs.H;

    }

}a[maxn];

int dp[maxn];

bool isok(int one, int two) {

    if (a[one].L > a[two].L && a[one].W > a[two].W) return true;

    else return false;

}

void work () {

    int t = ;

    for (int i = ; i <= n; ++i) {

        int x, y, z;

        cin >> x >> y >> z;

        a[++t] = node(x, y, z);

        a[++t] = node(x, z, y);

        a[++t] = node(y, x, z);

        a[++t] = node(y, z, x);

        a[++t] = node(z, x, y);

        a[++t] = node(z, y, x);

    }

    sort(a + , a +  + t);

    for (int i = ; i <= t; ++i) {

        dp[i] = a[i].H;

        for (int j = ; j < i; ++j) {

            if (isok(j, i)) {

                dp[i] = max(dp[i], dp[j] + a[i].H);

            }

        }

    }

    int ans = -inf;

    for (int i = ; i <= t; ++i) {

        ans = max(ans, dp[i]);

    }

    static int f = ;

    printf("Case %d: maximum height = %d\n", ++f, ans);

}

int main() {

#ifdef local

    freopen("data.txt","r",stdin);

#endif

//    IOS;

    while (cin >> n && n) work();

    return ;

}