#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
const ll inf = (1e18);
const ll mod = 1000000007;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll c, ll d) { return c / GCD(c, d) * d; }
struct __INIT {
  __INIT() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} __init;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
void pitsu() {
  int n;
  cin >> n;
  V<string> s(n);
  for (int i = 0; i < n; i++) cin >> s[i];
  V<V<bool>> able(n, V<bool>(n, false));
  for (int d = 0; d < 2; d++) {
    for (int i = 0; i < n; i++) {
      bool ok = false;
      for (int j = n - 1; j >= 0; j--) {
        if (s[i][j] == '0')
          ok = false;
        else if ((s[i][j] == '1' && j == n - 1) || able[i][j])
          ok = true;
        if (ok) able[i][j] = true;
      }
    }
    for (int i = 0; i < n; i++) {
      bool ok = false;
      for (int j = n - 1; j >= 0; j--) {
        if (s[j][i] == '0')
          ok = false;
        else if ((s[j][i] == '1' && j == n - 1) || able[j][i])
          ok = true;
        if (ok) able[j][i] = true;
      }
    }
  }
  bool ok = true;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (s[i][j] == '1' && !able[i][j]) {
        ok = false;
      }
    }
  }
  cout << (ok ? "YES" : "NO") << "\n";
}
int main() {
  int t;
  cin >> t;
  while (t--) pitsu();
}
