HDU_3679

#include<iostream>
#include<queue>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>
#define Mod 1000000007 
typedef __int64 ll;
const int maxn = 1100;
using namespace std;
int expe[maxn],last[maxn],thisy[maxn];
int score(int a,int b,int c)
{
    if(c<=a)return 3;
    if(c<b)return 2;
    return 1;
}
int main()
{
    int n,cs=0,ret,a;
    while(scanf("%d",&n)!=EOF&&n)
    {
        ret = 0;
        for(int i = 1; i<= n; i++)
        {
            scanf("%d",&a);
            thisy[a] = i;
        }
        for(int i = 1; i<= n; i++)
        {
            scanf("%d",&a);
            last[a] = i;
        }
        for(int i = 1; i<= n; i++)
            scanf("%d",&expe[i]);
        for(int i = 1; i <= n; i++)
            ret += score(expe[i],last[i],thisy[i]);
        printf("Case %d: %d\n",++cs,ret);
    }
    return 0;
}