#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>#include<map>#include<set>#include<bitset>#include<vector>using namespace std;typedef long long int LL;#define MAX(a,b) ((a)>(b)?(a):(b))#define MIN(a,b) ((a)<(b)?(a):(b))#define CL(a,b) memset(a,b,sizeof(a))#define pb push_back#define mp make_pair#define inf 0xfffffff#define N 3000000#define P 131#define L(x) (x<<1)#define R(x) ((x<<1)|1)int get(char*p){if(p[0]=='y')return 1;else return 0;}const double EPS = 1e-6;int main(){char s[22][3][4];int t,i,j,cas=1,hsc,asc;scanf("%d",&t);while(t--){hsc=0,asc=0;for(i=0;i<22;i++){for(j=0;j<3;j++){scanf("%s",s[i][j]);}}for(i=0;i<3;i++){for(j=0;j<11;j++){hsc+=get(s[j][i]);if(i==0&&j<5){if(hsc+4-j<asc)goto en;if(asc+5-j<hsc)goto en;}asc+=get(s[j+11][i]);if(i==0&&j<5){if(hsc+4-j<asc)goto en;if(asc+4-j<hsc)goto en;}if((i==0&&j>4)||i>0){if(hsc!=asc)goto en;}}}en:printf("Match %d:n",cas++);printf("Winner: %snScore: %d:%dn",hsc>asc?"home":"away",hsc,asc);}}
