Vertical Rooks - Hackerrank [most compact/fast]

import java.io.*;
public class Solution {
    public static void main(String[] args)throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int T=Integer.parseInt(br.readLine());
        for (int i=0;i<T;i++){
            int N=Integer.parseInt(br.readLine());
            int[] a=new int[N],b=new int[N];
            for (int j=0;j<N;j++){
                a[j]=Integer.parseInt(br.readLine());
            }
            for (int j=0;j<N;j++){
                b[j]=Integer.parseInt(br.readLine());
            }
            int sum=0;
            for (int h=0;h<a.length;h++)
                sum=sum^(Math.abs(a[h]-b[h])-1);
            if (sum!=0)
                System.out.println("player-2");
            else
                System.out.println("player-1");
        }
    }
}