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

const ll mod=1e9+7,N=1100000;

ll M;
ll n,m;
string s[30];
ll f[N],g[N];
ll d[200],l[N],r[N],h[N];
ll sz,ans;

bool cmp(string aa,string bb){
	return aa.length()>bb.length();
}

int main(){
	freopen("lowtea.in","r",stdin);
	freopen("lowtea.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n;
	M=(1<<n);
	for (int i=0;i<M;i++) f[i]=1;
	for (int i=1;i<M;i++){
		for (int j=20;j;j--){
			ll o=1<<j;
			if (i%o==0){
				l[i]=j;
				break;
			}
		}
	}
	r[0]=-1;
	for (int i=1;i<M;i++) r[i]=-r[i&(i-1)];
	for (int i=0;i<n;i++){
		cin>>s[i];
	}
	sort(s,s+n,cmp);
	sz=s[0].length();
	d[sz]=1;
	for(int i=sz-1;i>=0;--i){
		d[i]=d[i+1];
		for(int j=0;j<n;j++){
			if(s[j].size()>i&&s[j][i]=='?'){
				(d[i]*=2)%=mod;
			}
		}
	}
	for (int i=0;i<sz;i++){
		ll ls=0;
		while(s[n-1].size()<=i) n--;
		M=(1<<n);
		for (int j=1;j<M;j++){
			if (s[l[j]][i]=='?'){
				g[j]=g[j&(j-1)];
				h[j]=h[j&(j-1)]+1;
			}else{
				g[j]=g[j&(j-1)]|(1<<s[l[j]][i]-'0');
				h[j]=h[j&(j-1)];
			}
			if (!g[j]) (f[j]*=2)%=mod;
			else if (g[j]==3) f[j]=0;
		}
		for (int j=1;j<M;j++){
			if (f[j]) f[j]=(f[j]<<h[(M-1)^j])%mod;
			ls+=r[j]*f[j];
		}
		ans=(ans+ls%mod*d[i+1])%mod;
	}
	cout<<(ans+mod+d[0])%mod;
	return 0;
}