uva10795

#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
using namespace std;
int start[100],end[100];
ll solve(int *s,int k,int other)
{
  if(k==0)
	  return 0;
  if(s[k]==other)
	 return solve(s,k-1,other);
	  return solve(s,k-1,6-s[k]-other)+((ll)1<<(k-1));
}
int main()
{
  int n;
  int tt=0;
  while(cin>>n&&n)
  {
    int i;
	ll ans=0;
	for(i=1;i<=n;i++)
		scanf("%d",&start[i]);
for(i=1;i<=n;i++)
scanf("%d",&end[i]);
int k=n;
while(k>=1&&start[k]==end[k])
  k--;
  if(k)
ans=solve(start,k-1,6-start[k]-end[k])+solve(end,k-1,6-start[k]-end[k])+1;
printf("Case %d: %lld\n",++tt,ans);
  }
  return 0;
}