#include <bits/stdc++.h>

using namespace std;


vector <int> d;
int n=INT_MAX,m,x,a[100000];
bool D[10];

void init()
{
	scanf("%d",&m);
	for(int i=0;i<m;i++)
	{
		scanf("%d",&x);
		D[x]=true;
		d.push_back(x);
	}
	
	scanf("%d",&n);
	for(int i=0;i<n;i++)
		scanf("%d",&a[i]);

}

int check(int i)
{	
	int index,i1,curr=0;
	for(int k=0;k<d.size();k++)
	{
		i1=i;
		index=0;
		while(i1%d[k]==0)
		{
			i1/=d[k];
			index++;
		}
		curr+=index;
		index=0;
	}
	i1=i;
	while(i1>0)
	{
		if(D[i1%10])curr++;
		i1/=10;
	}
	return curr;	
}

int solve()
{
	int i=1,j=0,curr;
	while(i<=1000000&&j<n)
	{
		curr=check(i);
		if(curr==a[j])j++;
		else j=0;
		i++;
	}
	return check(i);
}

int main()
{
	freopen("tsuk.in","r",stdin);
	freopen("tsuk.out","w",stdout);
	init();
	printf("%d",solve());
}

/*
2
5 7
5
1 1 0 0 0  

3
3 7 8 
6 
1 1 1 1 1 1 
*/