#include <cstdio>

using namespace std;

typedef long long LL;

LL ans;

int n,t,k;

int a[80],b[80];

inline LL f(int *c,int i,int l)

{

if(i==0) return 0;

if(c[i]==l) return f(c,i-1,l);

return f(c,i-1,6-l-c[i]) + (1LL<<(i-1));

}

int main()

{

while(scanf("%d",&n) == 1)

{

if(n==0) return 0;

for(int i=1;i<=n;i++) scanf("%d",&a[i]);

for(int i=1;i<=n;i++) scanf("%d",&b[i]);

k = n;

while(k>=1 && a[k] == b[k]) k--;

ans=0;

if(k>=1)

{

int el = 6 - a[k] - b[k];

ans = f(a,k-1,el) + f(b,k-1,el) + 1;

}

printf("Case %d: %lld\n",++t,ans);

}

return 0;

}