Given a Binary Square Matrix where each row and column of the matrix is sorted in ascending order. Find the total number of Zeros present in the matrix.

Input:
The first line of input will be the no of test cases then T test cases will follow. The second line of each test case contains an integer N denoting the dimension of the matrix. Then in the next line are the space separated values of the matrix A[ ] [ ].

Output:
Print in a single line, the total number of zeros present in the given Binary Matrix.

User Task:
You don't need to read input or print anything. Your task is to complete the function countZeros() which takes the Binary Matrix A[][] and its size N as inputs and returns an integer denoting the total number of Zeros present in the matrix.

Expected Time Complexity: O(N). Expected Auxiliary Space: O(1).

Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.