#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define MOD 1000000007
int t;
char s1[2010],s2[2010];
long long f[2010][2010];
int main()
{
	cin>>t;
	while (t)
		{
		t--;
		int n;
		cin>>n;
		for (int i=1;i<=n;i++) cin>>s1[i];
		for (int i=1;i<=n;i++) cin>>s2[i];
		memset(f,0,sizeof(f));
		for(int i=1;i<=n;i++) f[i][0] = f[0][i] = 1;
		for (int i=1;i<=n;i++)
			{
			for (int j=1;j<=n;j++)
				{
				if (s1[i]=='0' and s2[j]=='0')
					{
					f[i][j] = 1;
					continue;
					}
				if (s1[i]=='0')
					{
					f[i][j] = (f[i][j-1]+1-isdigit(s2[j]))%MOD;
					continue;
					}
				if (s2[j]=='0')
					{
					f[i][j] = (f[i-1][j]+1-isdigit(s1[i]))%MOD;
					continue;
					}
				f[i][j] = (f[i-1][j]+f[i][j-1])%MOD;
				if (s1[i]=='1' or s2[j]=='1')
					{
					f[i][j] = (f[i][j]-f[i-1][j-1]+MOD)%MOD;
					}
				else if (s1[i]=='+' and s2[j]=='+')
					{
					f[i][j] = (f[i][j]-f[i-1][j-1]+MOD)%MOD;
					}
				else if (isdigit(s1[i]) and isdigit(s2[j]))
					{
					f[i][j] = (f[i][j]-f[i-1][j-1]+MOD)%MOD;
					}
				}
			}
		cout<<f[n][n]%MOD<<endl;
		}
}