D

[https://vjudge.net/contest/220165#problem/D]

#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 1010
int main(){
	int n,a[maxn],b[maxn];
	int kase=0;
	while(cin>>n&&n){
		printf("Game %d:\n",++kase);
		for(int i=0;i<n;i++)
		cin>>a[i];
		for(;;){
			int A=0,B=0;
			for(int i=0;i<n;i++) {
				cin>>b[i];
				if(a[i]==b[i])
				A++;
			}
			if(b[0]==0) break;
			for(int d=1;d<10;d++){
				int c1=0,c2=0;
				for(int i=0;i<n;i++)
				{
					if(a[i]==d) c1++;
				if(b[i]==d) c2++;
				}
				B+=min(c1,c2);
			}
			printf("    (%d,%d)\n",A,B-A);
		}	
	}
	return 0;
}