#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pir pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
inline int re()
{
    int f=1,num=0;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9') num=num*10+c-'0',c=getchar();
    return num*f;
}
int T;
void clear();
const int N=25,MOD=1e9+7;
char s[N][110];
int n;
int len[N];
int ml;
int c[1<<21],suf[N][110];
int ans;
int qpow(int a,int b=MOD-2)
{
    int mul=1;
    while(b)
    {
        if(b&1) mul=mul*a%MOD;
        b>>=1;a=a*a%MOD;
    }
    return mul;
}
void work()
{
    freopen("lowtea.in","r",stdin);
    freopen("lowtea.out","w",stdout);
    clear();
    n=re();
    for(int i=0;i<n;i++)
    {
        scanf("%s",s[i]+1);
        len[i]=strlen(s[i]+1);
        ml=max(ml,len[i]);
    }
    for(int i=0;i<n;i++)
    {
        for(int j=len[i];j>=1;j--)
        {
            if(s[i][j]=='?') suf[i][j]++;
            suf[i][j]+=suf[i][j+1];
        }
    }
    for(int k=1;k<(1<<n);k++) c[k]=1;
    int tt=0;
    for(int i=0;i<n;i++) tt+=suf[i][1];
    (ans+=qpow(2,tt))%=MOD;
    // cout<<tt<<endl;
    for(int i=1;i<=ml;i++)
    {
        for(int k=1;k<(1<<n);k++)
        {
            if(c[k]==0) continue;
            int n0=0,n1=0,n5=0,tmp=0,num=0;
            for(int j=0;j<n;j++)
            {
                if((k>>j)&1)
                {
                    if(len[j]<i)
                    {
                        c[k]=0;
                        break;
                    }
                    if(s[j][i]=='0') n0++;
                    else if(s[j][i]=='1') n1++;
                    else if(s[j][i]=='?') n5++;
                    tmp+=suf[j][i+1];
                    num++;
                }
                else tmp+=suf[j][1];
            }
            if(n0&&n1) c[k]=0;
            if(c[k]==0) continue;
            if(n0==0&&n1==0) c[k]=(c[k]+c[k])%MOD;
            // cout<<"***"<<i<<' '<<k<<' '<<c[k]<<' '<<tmp<<' '<<num<<endl;
            (ans+=(num%2==1?1:MOD-1)*c[k]%MOD*qpow(2,tmp)%MOD)%=MOD;
        }
    }
    printf("%lld\n",ans);
    return;
}
signed main()
{
    T=1;
    while(T--) work();
    return 0;
}
void clear()
{
    return;
}