#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll mod=1e9+7;

ll t,n;
char s1[2010],s2[2010];
char a[2010],b[2010];
ll lena,lenb;
ll f[2010][2010];
int main()
{
	cin>>t;
	while(t--)
	{
		memset(f,0,sizeof(f));
		cin>>n;
		for(ll i=1;i<=n;i++)
			cin>>s1[i];
		for(ll i=1;i<=n;i++)
			cin>>s2[i];
		lena=0,lenb=0;
		for(ll i=1;i<=n;i++)
		{
			if(s1[i]!='1') a[++lena]=s1[i];
			if(s2[i]!='1') b[++lenb]=s2[i];
		}
		for(ll i=0;i<=lena;i++)
			for(ll j=0;j<=lenb;j++)
			{
				if(!i||!j)
				{
					f[i][j]=1;
					continue ;
				}
				if(a[i]=='0') f[i][j]=1; else f[i][j]=f[i-1][j]%mod;
				if(b[i]=='0') f[i][j]=(f[i][j]+1)%mod; else f[i][j]=(f[i][j]+f[i][j-1])%mod;
				if(a[i]=='+'&&b[j]=='+'||isdigit(a[i])&&isdigit(b[j]))
				{
					if(a[i]=='0'||b[j]=='0') f[i][j]-=1;
					else f[i][j]=(f[i][j]-f[i-1][j-1]+mod)%mod;
				}
			}
		cout<<f[lena][lenb]%mod<<endl;
	}
}