Codecraft-17 and Codeforces Round ＃391 (Div. 1 + Div. 2, combined) D. Felicity‘s Big Secret Revealed

#include<bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define eps 1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))

typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long uLL;

const int maxn = 1048576+10;
const int INF  = 1<<30;
const int mod  = 1e9+7;

int n,a[80];string s;
int dp[80][maxn],num[80][80];
void solve(){
    
    // cout<<(1<<20)<<endl;
    cin>>n>>s;
    for(int i=1;i<=n;i++) a[i]=s[i-1]-'0';
    for(int i=1;i<=n;i++){
    
        for(int j=i,k=0;j<=n;j++){
    
            k=k*2+a[j];
            if(k>20) break;
            num[i][j]=k;
        }
    }
    // cout<<num[2][4]<<endl;
    for(int i=1;i<=n;i++){
    
        dp[i][0]=1;
        for(int j=0;j<=(1<<20)-1;j++){
    
            if(dp[i][j]==0) continue;
            for(int k=i;k<=n;k++){
    
                if(num[i][k]==0) continue;
                dp[k+1][j|(1<<(num[i][k]-1))]+=dp[i][j];
                dp[k+1][j|(1<<(num[i][k]-1))]%=mod;
            }
        }
    }
    int ans=0;
    for(int i=2;i<=n+1;i++){
    
        for(int j=1;j<=20;j++){
    
            ans=(ans+dp[i][(1<<j)-1])%mod;
        }
    }

    cout<<ans<<endl;
    return;
}

int main()
{
    
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
// ios::sync_with_stdio(false);
    int t = 1;
    //scanf("%d",&t);
    while(t--){
    
    // printf("Case %d: ",cas++);
        solve();
    }
    return 0;
}