#include<bits/stdc++.h>
using namespace std;
int n;
int a[100],dsu[5];
string s;
unordered_set<string>ok;
map<unsigned long long,unsigned long long>f;
queue<unsigned long long>q;
vector<unsigned long long>v[100];
int find(int x){
	return dsu[x]==x? x:dsu[x]=find(dsu[x]);
}
int main(){
	for(int i=0;i<64;i++)
		scanf("%d",&a[i]);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		cin>>s,ok.insert(s);
	int I[4];
	for(I[0]=0;I[0]<64;I[0]++)
		for(I[1]=I[0]+1;I[1]<64;I[1]++)
			for(I[2]=I[1]+1;I[2]<64;I[2]++)
				for(I[3]=I[2]+1;I[3]<=64;I[3]++){
					int c=3;
					string s;
					unsigned long long S=(1llu<<I[0])|(1llu<<I[1])|(1llu<<I[2]);
					s.resize(3),s[0]=a[I[0]]+48,s[1]=a[I[1]]+48,s[2]=a[I[2]]+48;
					if(I[3]<64)
						c++,s=s+(char)(a[I[3]]+48),S|=1llu<<I[3];
					if(ok.find(s)==ok.end())
						continue;
					dsu[0]=0,dsu[1]=1,dsu[2]=2,dsu[3]=3;
					for(int u=0;u<c;u++)
						for(int v=u+1;v<c;v++)
							if(abs(I[u]/8-I[v]/8)+abs(I[u]%8-I[v]%8)<=1)
								dsu[find(u)]=find(v);
					if(find(0)==find(1)&&find(1)==find(2)&&(c==3||find(2)==find(3)))
						for(int i=0;i<c;i++)
							v[I[i]].emplace_back(S);
				}
	q.push(0),f[0]=1;
	while(!q.empty()){
		unsigned long long S=q.front(),T;
		q.pop();
		for(int i=0;i<64;i++)
			if(((S>>i)&1)==0){
				for(int j=0;j<v[i].size();j++)
					if((S&v[i][j])==0){
						T=S|v[i][j];
						if(f.count(T)==0)
							q.push(T);
						f[T]+=f[S];
					}
				break;
			}
	}
	printf("%llu\n",f[-1ull]);
	return 0;
}