#include<iostream>
#include<cstdio>
#define N 1000000
#define mod 1000000007
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
int T,n,tans,a[N+1],dp[N+1][2],DP[N+1][2],dp2[N+1][2],DP2[N+1][2];
int main()
{
	char c;
	bool op=0;
	int ans;
	T=read();
	while (T--)
	{
		n=read(),tans=op=0;
		for (int i=1;i<=n;++i) cin>>c,a[i]=c-'0';
		for (int i=1;i<=n;++i) dp[i][0]=dp[i][1]=DP[i][0]=DP[i][1]=dp2[i][0]=dp2[i][1]=DP2[i][0]=DP2[i][1]=inf;
		for (int i=1;i<=n;++i)
		{
			if (!op) dp[i][0]=0;
			if (a[i]) op=1;
			if (i-1>=1)
			{
				dp[i][1]=min(dp[i][1],dp[i-1][a[i-1]^1]+2);
				dp[i][0]=min(dp[i][0],dp[i-1][a[i-1]]+4);
				DP[i][0]=min(DP[i][0],min(dp[i-1][a[i-1]^1],DP[i-1][a[i-1]^1])+1);
				DP[i][1]=min(DP[i][1],min(dp[i-1][a[i-1]],DP[i-1][a[i-1]])+3);
			}
		}
		op=0;
		for (int i=n;i>=1;--i)
		{
			if (!op) dp2[i][0]=0;
			if (a[i]) op=1;
			if (i+1<=n)
			{
				dp2[i][1]=min(dp2[i][1],dp2[i+1][a[i+1]^1]+2);
				dp2[i][0]=min(dp2[i][0],dp2[i+1][a[i+1]]+4);
				DP2[i][0]=min(DP2[i][0],min(dp2[i+1][a[i+1]^1],DP2[i+1][a[i+1]^1])+1);
				DP2[i][1]=min(DP2[i][1],min(dp2[i+1][a[i+1]],DP2[i+1][a[i+1]])+3);
			}
		}
		for (int i=1;i<=n;++i)
		{
			ans=inf;
			ans=min(ans,dp[i][0]+dp2[i][a[i]]);
			ans=min(ans,dp[i][0]+DP2[i][a[i]]);
			ans=min(ans,DP[i][0]+dp2[i][a[i]]);
			ans=min(ans,dp[i][1]+dp2[i][a[i]^1]);
			ans=min(ans,dp[i][1]+DP2[i][a[i]^1]);
			ans=min(ans,DP[i][1]+dp2[i][a[i]^1]);
			Adder(tans,1ll*ans*i%mod);
		}
		printf("%d\n",tans);
	}
	return 0;
}