/*
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <stdlib.h>
using namespace std;
///
char str[10000];
int search(const int start,const int end)
{
int arr[end-start];
int c_cnt =0;
int cnt = 0;
int answer=0;
int i;
int j;
int x = 0;
for(i = start; i <= end; i++)
{
if(str[i]>='0'&&str[i]<='9')
{
if(i-1!=-1&&str[i-1]=='*')
{
arr[cnt-1] *= str[i]-'0';
}
else
{
arr[cnt] = str[i]-'0';
cnt++;
}
}
else if(str[i]=='(')
{
x =1;
for(j = i+1; x != 0; j++)
{
if(str[j] == '(')
{
x++;
}
if(str[j] == ')')
{
x--;
}
}
if(i-1!=-1&&str[i-1]=='*')
{
arr[cnt-1] *= search(i+1,j-1);
}
else
{
arr[cnt] = search(i+1,j-1);
cnt++;
}
x = 0;
i = j-1;
}
}
for(i = 0;i < cnt;i++)
{
answer += arr[i];
}
return answer;
}
int main()
{
stack<char> st;
int n;
int i;
int test;
for(test = 1; test <= 10; test++)
{
//scanf("%d",&n);
scanf("%s",str);
printf("#%d %d\n",test,search(0,strlen(str)-1));
}
}
*/
#include <stdio.h>
int main()
{
char map[10][10];
char str[8];
int answer=0;
int i,j;
int n;
int test = 1;
for(test=1;test <= 10;test++)
{
answer = 0;
scanf("%d",&n);
for(i =0;i < 8;i++)
{
scanf("%s",map[i]);
}
for(i = 0;i < 8;i++)
{
}
}
}