PA2013 2.B JED

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class jed {

    static int n;
    public static void main (String[] args) throws IOException {

        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        n = Integer.parseInt(in.readLine());
        int biggestWin = 0;
        int actualWin = 0;
        int[][] array = new int[3][n];

        String[] string = new String[n];
        for (int i = 0; i < array.length; i++) {

            string = in.readLine().split(" ");
            for (int j = 0; j < n; j++) {

                array[i][j] = Integer.parseInt(string[j]);
            }
        }
        in.close();

        for (int i = 0; i < n; i++) {

            for (int j = 0; j < n; j++) {

                for (int k = 0; k < n; k++) {

                    actualWin = checkWins(array, i, j, k);
                    if (actualWin > biggestWin) biggestWin = actualWin;
                }
            }
        }

        System.out.print(biggestWin);
    }

    public static int checkWins (int[][] array, int moveA, int moveB, int moveC) {

        int wins = 0;
        for (int i = 0; i < n; i++) {

            if (isWygrana(getNumber(array[0], i, moveA), getNumber(array[1], i, moveB), getNumber(array[2], i, moveC)))
                wins++;
        }

        return wins;
    }

    public static Boolean isWygrana (int a, int b, int c) {

        if (a == b && b == c)   return true;
        return false;
    }

    public static int getNumber (int[] array, int number, int change) {

        for (;;) {
            if (number + change >= n)       change -= n;
            else if (number + change < 0)   change += n;
            else                            break;
        }
        return array[number + change];
    }
}