#include<iostream>
#include<stdio.h>
#include<ctype.h>
#include<string.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pii pair<int,int>
#define lowbit(x) ((x)&-(x))
#define popcount(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define umap unordered_map
#define all(x) x.begin(),x.end()
#define mk make_pair
#define pb push_back
#define ckmax(x,y) x=max(x,y)
#define ckmin(x,y) x=min(x,y)
#define rep(i,l,r) for(int i=l;i<=r;++i)
#define per(i,r,l) for(int i=r;i>=l;--i)
#define N 5005
using namespace std;
inline int read(){
	int x=0,f=0; char ch=getchar();
	while(!isdigit(ch)) f|=(ch==45),ch=getchar();
	while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}
bool G[N][N];
int n,dfn[N],low[N],vis[N],st[N],top;
char s[N];
const int mo=1e9+7;
inline void red(int &x){x>=mo?x-=mo:0;}
inline int qpow(int x,int b){
	int res=1;
	for(;b;x=1LL*x*x%mo,b>>=1) if(b&1) res=1LL*res*x%mo;
	return res;
}
int res;
void tarjan(int u){
	dfn[u]=low[u]=++dfn[0];
	vis[u]=1,st[++top]=u;
	for(int v=1;v<=n;++v){
		if(!G[u][v]) continue;
		if(!dfn[v]){
			tarjan(v);
			ckmin(low[u],low[v]);
		}
		else if(vis[v]) ckmin(low[u],dfn[v]);
	}
	if(dfn[u]==low[u]){
		res++;
		while(st[top]!=u) vis[st[top]]=0,top--;
		vis[st[top]]=0;
		top--;
	}
}
inline int calc(){
	dfn[0]=0;
	for(int i=1;i<=n;++i) dfn[i]=low[i]=vis[i]=0;
	top=res=0;
	for(int i=1;i<=n;++i) if(!dfn[i]) tarjan(i);
	return res;
}
signed main(){
	n=read();
	for(int i=2;i<=n;++i){
		scanf("%s",s+1);
		int len=strlen(s+1);
		for(int j=1;j<=len;++j){
			int x;
			if(!isdigit(s[j])) x=s[j]-'A'+10;
			else x=s[j]-'0';
			for(int k=0;k<=3;++k){
				G[i][4*j+k-3]=((x>>k)&1);
			}
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=i+1;j<=n;++j) G[i][j]=(!G[j][i]);
	}
	int ans=0;
	for(int i=1;i<=n;++i){
		for(int j=1;j<i;++j){
			swap(G[i][j],G[j][i]);
			red(ans+=1LL*qpow(2,(i-2)*(i-1)/2+j-1)*calc()%mo);
			swap(G[i][j],G[j][i]);
		}
	}
	cout<<ans;
	return 0;
}