#include <bits/stdc++.h>
using namespace std;

const int N = 2005, mod = 1e9 + 7;

int n,f[N][N][2],lena,lenb,T;
char str[N],a[N],b[N];

void Sin(char s[],int &slen){//特殊输入过滤0,1将串转化成全部为+或* 
	slen=0;
	cin>>str;
	int len=strlen(str); 
	for(int i=0;i<len;i++){
		if(str[i]=='0')slen=0;
		else if(str[i]=='1')continue;
		if(str[i]!='+')str[i]='*';
		s[++slen]=str[i];
	}
}

int pin(int a,int b){
	a+=b;
	return a>=mod?a-mod:a;
}

int main(){
	freopen("prob2_gold_22open.in","r",stdin);
	freopen("prob2_gold_22open.out","w",stdout); 
	cin>>T;
	while(T--){
		cin>>n;
		Sin(a,lena),Sin(b,lenb);
		f[0][0][1]=1;
		for(int i=0;i<=lena;i++){
			for(int j=0;j<=lenb;j++){
				if(i<lena)f[i+1][j][0]=pin(f[i][j][0],f[i][j][1]);
				if(j<lenb)f[i][j+1][1]=f[i][j][1];
				if(i>0&&j<lenb&&a[i]!=b[j+1])f[i][j+1][1]=pin(f[i][j+1][1],f[i][j][0]);
			}
		}
		printf("%d\n",pin(f[lena][lenb][0],f[lena][lenb][1]));
	}
	return 0;
}