#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
#define mr make_pair
#define fi first
#define se second
using vi = vector<int>; using vii = vector<pii>;
#define pb emplace_back
#define sz(x) ((int)(x).size())
template<class T, class U> inline void cmn(T &x, const U &y) { if(y < x) x = y; }
template<class T, class U> inline void cmx(T &x, const U &y) { if(y > x) x = y; }
const char nl = '\n', nk = ' ';
const int inf = sizeof(int) == 4 ? 0x3f3f3f3f : 0x3f3f3f3f3f3f3f3f;

const int P = 1e9 + 7;

const int N = 5010;

int n;
bool a[N][N];
int pre[N][N];
int adp[N], sup[N];

void mian() {
  cin >> n;
  for(int i = 2; i <= n; ++i) {
    static char s[N]; cin >> s + 1;
    int m = (i + 2) / 4;
    for(int j = 1; j <= m; ++j) {
      int val = s[j] <= '9' ? s[j] ^ 48 : s[j] - 'A' + 10;
      for(int k = 0; k < 4; ++k) {
        int K = 4 * j + k - 3;
        if(K >= i) break;
        if(val >> k & 1) a[i][K] = true;
        else a[K][i] = true;
      }
    }
  }
  static int deg[N], cnt[N], sum[N];
  for(int i = 1; i <= n; ++i) deg[i] = count(a[i] + 1, a[i] + n + 1, true), ++cnt[deg[i]];
  for(int i = 1; i <= n; ++i) sum[i] = deg[i];
  sort(sum + 1, sum + n + 1);
//  for(int i = 1; i <= n; ++i) cerr << sum[i] << (i == n ? nl : nk);
  int ori = 0;
  for(int i = 1; i <= n; ++i) ori += (sum[i] += sum[i - 1]) == i * (i - 1) / 2;
  for(int l = 1; l <= n; ++l) {
    int res0 = ori, res1 = ori;
    for(int r = l; r < n; ++r) {
      res0 += (sum[r] - 1 == r * (r - 1) / 2) - (sum[r] == r * (r - 1) / 2);
      res1 += (sum[r] + 1 == r * (r - 1) / 2) - (sum[r] == r * (r - 1) / 2);
      pre[l][r + 1] = res0;
      pre[r + 1][l] = res1;
    }
  }
  for(int i = 1; i <= n; ++i) adp[sum[i] - sum[i - 1]] = i;
  for(int i = n; i; --i) sup[sum[i] - sum[i - 1]] = i;
//  for(int i = 0; i < n; ++i) cerr << adp[i] << nk << sup[i] << nl;
  int ans = 0, pw = 1;
  for(int i = 1; i <= n; ++i) for(int j = 1; j < i; ++j) {
    int x = i, y = j;
    if(a[y][x]) swap(x, y);
//    cerr << sup[deg[x]] << nk << adp[deg[y]] << nl;
    int res = deg[x] == deg[y] + 1 ? ori : pre[sup[deg[x]]][adp[deg[y]]];
    ans = (ans + (ll)res * pw) % P;
    if((pw += pw) >= P) pw -= P;
  }
  cout << ans << nl;
}

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t = 1;
//  cin >> t;
  while(t--) mian();
  return 0;
}