变换的矩阵

import java.io.InterruptedIOException;
import java.time.chrono.JapaneseChronology;
import java.util.Scanner;

public class Main {
    public static void main(String[] ar) {
		Scanner cin=new Scanner(System.in); 
		int n=cin.nextInt();
		String[][]a=new String[n][n];
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<n;j++)
			{
				a[i][j]=cin.next();
			}
		}
		int num1=0,num2=0,num3=0,num4=0;
		String[][]b=new String[n][n];
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<n;j++)
			{
				b[i][j]=cin.next();
			}
		}
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<n;j++)
			{
				if(a[i][j].equals(b[j][n-i-1]))
				{
					num1++;
				}
				if(a[i][j].equals(b[n-j-1][i]))
				{
					num2++;
				}
				if(a[i][j].equals(b[n-i-1][n-j-1]))
                {
                	num3++;
                }
				if(a[i][j].equals(b[i][j]))
				{
					num4++;
				}
			}
		}
		if(num1==n*n)
		{
			System.out.println("1");
		}
		else if(num2==n*n)
		{
			System.out.println("2");
		}
		else if(num3==n*n)
		{
			System.out.println("3");
		}
		else if(num4==n*n)
		{
			System.out.println("4");
		}
		else 
		{
			System.out.println("5");
		}
	}
}