#include<stdio.h>
int turn90(int arr[11][11]);
int turn180(int arr[11][11]);
int turn270(int arr[11][11]);
int mirror(int arr[11][11]);
int together1(int arr[11][11]);
int together2(int arr[11][11]);
int together3(int arr[11][11]);
int nothing(int arr[11][11]);
int n;
int begin[11][11];
int goal[11][11];
int become[11][11];
int main(){
scanf("%d",&n);
char nohelp;
scanf("%c",&nohelp);
int i,j;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
char sign;
scanf("%c",&sign);
if(sign=='\n') j--;
if(sign=='@') begin[i][j]=0;
if(sign=='-') begin[i][j]=1;
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
char sign;
scanf("%c",&sign);
if(sign=='\n') j--;
if(sign=='@') goal[i][j]=0;
if(sign=='-') goal[i][j]=1;
}
}
if(turn90(begin)==1){
printf("1");
return 0;
}
if(turn180(begin)==1){
printf("2");
return 0;
}
if(turn270(begin)==1){
printf("3");
return 0;
}
if(mirror(begin)==1){
printf("4");
return 0;
}
if(together1(begin)==1){
printf("5");
return 0;
}
if(together2(begin)==1){
printf("5");
return 0;
}
if(together3(begin)==1){
printf("5");
return 0;
}
if(nothing(begin)==1){
printf("6");
return 0;
}
printf("7");
return 0;
}
int turn90(int arr[11][11]){
int i,j;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
become[j][n+1-i]=arr[i][j];
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(become[i][j]!=goal[i][j]) return 0;
}
}
return 1;
}
int turn180(int arr[11][11]){
int i,j;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
become[n+1-i][n+1-j]=arr[i][j];
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(become[i][j]!=goal[i][j]) return 0;
}
}
return 1;
}
int turn270(int arr[11][11]){
int i,j;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
become[n+1-i][n+1-j]=arr[i][j];
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(become[n+1-j][i]!=goal[i][j]) return 0;
}
}
return 1;
}
int mirror(int arr[11][11]){
int i,j;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
become[i][n+1-j]=arr[i][j];
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(become[i][j]!=goal[i][j]) return 0;
}
}
return 1;
}
int together1(int arr[11][11]){
int i,j;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
become[j][i]=arr[i][j];
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(become[i][j]!=goal[i][j]) return 0;
}
}
return 1;
}
int together2(int arr[11][11]){
int i,j;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
become[n+1-i][j]=arr[i][j];
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(become[i][j]!=goal[i][j]) return 0;
}
}
return 1;
}
int together3(int arr[11][11]){
int i,j;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
become[n+1-j][n+1-i]=arr[i][j];
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(become[i][j]!=goal[i][j]) return 0;
}
}
return 1;
}
int nothing(int arr[11][11]){
int i,j;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(arr[i][j]!=goal[i][j]) return 0;
}
}
return 1;
}