1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int maxn=1e6+5;
 4 const int INF=1e9+7;
 5 int x[205],y[205],z[205];
 6 int n,cas,ans,dp[205];
 7 bool g[155][155];
 8 template <class t>void red(t &x)
 9 {
10     x=0;
11     int w=1;
12     char ch=getchar();
13     while(ch<'0'||ch>'9')
14     {
15         if(ch=='-')
16             w=-1;
17         ch=getchar();
18     }
19     while(ch>='0'&&ch<='9')
20     {
21         x=(x<<3)+(x<<1)+ch-'0';
22         ch=getchar();
23     }
24     x*=w;
25 }
26 void input()
27 {
28     freopen("input.txt","r",stdin);
29 }
30 bool check(int a,int b)
31 {
32     if((x[a]<x[b]&&y[a]<y[b])||(x[a]<y[b]&&y[a]<x[b]))
33         return 1;
34     return 0;
35 }
36 int solve(int u)
37 {
38     if(dp[u])
39         return dp[u];
40     dp[u]=z[u];
41     for(int i=0;i<n;++i)
42         if(g[u][i])
43             dp[u]=max(dp[u],solve(i)+z[u]);
44     return dp[u];
45 }
46 int main()
47 {
48     input();
49     while(scanf("%d",&n)==1&&n)
50     {
51         ++cas;
52         ans=0;
53         //memset(g,0,sizeof(g));
54         memset(dp,0,sizeof(dp));
55         printf("Case %d: maximum height = ",cas);
56         for(int i=0;i<n;++i)
57         {
58             red(x[i]);
59             red(y[i]);
60             red(z[i]);
61             x[i+n]=y[i];
62             y[i+n]=z[i];
63             z[i+n]=x[i];
64             x[i+n+n]=z[i];
65             y[i+n+n]=x[i];
66             z[i+n+n]=y[i];
67         }
68         n*=3;
69         for(int i=0;i<n;++i)
70             for(int j=i+1;j<n;++j)
71             {
72                 g[i][j]=check(i,j);
73                 g[j][i]=check(j,i);
74             }
75         for(int i=0;i<n;++i)
76             ans=max(ans,solve(i));
77         printf("%d\n",ans);
78     }
79     return 0;
80 }