1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cstdlib>
 5 #include <algorithm>
 6 #include <queue>
 7 #include <cmath>
 8 #include <vector>
 9 #define min(a, b) ((a) < (b) ? (a) : (b))
10 #define max(a, b) ((a) > (b) ? (a) : (b))
11 #define abs(a) ((a) < 0 ? (-1 * (a)) : (a))
12 inline void swap(long long &a, long long &b)
13 {
14     long long tmp = a;a = b;b = tmp;
15 }
16 inline void read(long long &x)
17 {
18     x = 0;char ch = getchar(), c = ch;
19     while(ch < '0' || ch > '9') c = ch, ch = getchar();
20     while(ch <= '9' && ch >= '0') x = x * 10 + ch - '0', ch = getchar();
21     if(c == '-') x = -x;
22 }
23
24 const long long INF = 0x3f3f3f3f;
25 const long long MAXN = 60 + 5;
26
27 long long start[MAXN], final[MAXN];
28
29 long long n;
30
31 long long dfs1(long long i, long long j)
32 {
33     if(i <= 0) return 0;
34     if(start[i] == j) return dfs1(i - 1, j);
35     return dfs1(i - 1, 6 - start[i] - j) + ((long long)1 << (i - 1));
36 }
37
38 long long dfs2(long long i, long long j)
39 {
40     if(i <= 0) return 0;
41     if(final[i] == j) return dfs2(i - 1, j);
42     return dfs2(i - 1, 6 - final[i] - j) + ((long long)1 << (i - 1));
43 }
44
45 long long t;
46
47 int main()
48 {
49     while(scanf("%d", &n) != EOF && n)
50     {
51         ++ t;
52         memset(start, 0, sizeof(start));
53         memset(final, 0, sizeof(final));
54         for(register long long i = 1;i <= n;++ i) read(start[i]);
55         for(register long long i = 1;i <= n;++ i) read(final[i]);
56         long long k = n;
57         while(start[k] == final[k] && k) --k;
58         if(k <= 0) printf("Case %lld: 0\n", t);
59         else printf("Case %lld: %lld\n", t, dfs1(k - 1, 6 - start[k] - final[k]) + dfs2(k - 1, 6 - start[k] - final[k]) + 1);
60     }
61     return 0;
62 }