#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define mod 1000000007
pair<ll,bl> pre[1000010];
ll T,n,l,r,c[1000010],suf[1000010][2],ans;
char s[1000010];
il void init(){
	if((s[l]^1)=='0') pre[l]=MP(1,1);
	else pre[l]=MP(3,0);
	fr(i,l+1,n){
		if((s[i]^1^pre[i-1].sec)=='0'){
			pre[i].fir=pre[i-1].fir+1;
			pre[i].sec=1;
		}
		else{
			pre[i].fir=pre[i-1].fir+3;
			pre[i].sec=0;
		}
	}
	fr(o,0,1){
		if((s[r-1]^o)=='0') suf[r-1][o]=1;
		else suf[r-1][o]=2;
	}
	pfr(i,r-2,1){
		fr(o,0,1){
			if((s[i]^o)=='0') suf[i][o]=suf[i+1][1]+1;
			else suf[i][o]=suf[i+1][0]+3;
		}
	}
}
il void solve(ll x){
	if(!l){
		c[x]=min(c[x],0ll);
		return;
	}
	if(l==r&&l==x){
		c[x]=min(c[x],3ll);
		return;
	}
	if(x<r){
		if(x<=l) c[x]=min(c[x],suf[x][0]);
		else c[x]=min(c[x],x-l+pre[x-1].fir+suf[x][pre[x-1].sec]);
	}
}
int main(){
	T=read();
	while(T--){
		n=read();
		scanf("%s",s+1);
		l=r=ans=0;
		pfr(i,n,1) if(s[i]=='1') l=i;
		fr(i,1,n) if(s[i]=='1') r=i;
		fr(i,1,n) c[i]=inf;
		init();
		fr(i,1,n) solve(i);
		reverse(s+1,s+n+1);
		reverse(c+1,c+n+1);
		l=r=0;
		pfr(i,n,1) if(s[i]=='1') l=i;
		fr(i,1,n) if(s[i]=='1') r=i;
		init();
		fr(i,1,n) solve(i);
		reverse(c+1,c+n+1);
		fr(i,1,n) ans=(ans+i*c[i])%mod;
		writeln(ans);
	}
}