#include <bits/stdc++.h>

using namespace std;

const int MAX = (int) 1e3;

const int MAXN = (int) 1e3 + 5;

int a[MAXN][MAXN];

int main() {
  int T;
  scanf("%d", &T);
  assert(T >= 1 && T <= 10);
  while (T--) {
    int n;
    scanf("%d", &n);
    assert(n >= 1 && n <= MAX);
    int nonZeros = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        scanf("%d", &a[i][j]);
        assert(a[i][j] >= 0 && a[i][j] <= 1);
        if (a[i][j] != 0) {
          nonZeros++;
        }
      }
    }
    nonZeros -= n;
    int width = 0;
    for (int k = 1; k <= n - 1 && nonZeros > 0; k++) {
      nonZeros -= 2 * (n - k); 
      width++;
    }
    printf("%d\n", width);
  }
  return 0;
}