#include<iostream>
#include<fstream>
#include<vector>

using namespace std;

const int MAXN = 1e6 + 5;

int n, m;
int a[MAXN];
bool usedDigits[10];

int cnt[MAXN];
int f[MAXN];

void Init()
{
    vector <int> dig = {2, 3, 5, 7};
    for(int i = 1;i<MAXN;i++)
    {
        int x = i;
        while(x!=0)
        {
            if(usedDigits[x%10]==true) cnt[i]++;
            x/=10;
        }

        x = i;
        for(int d: dig)
        {
            if(usedDigits[d]==true)
            {
                while(x%d==0)
                {
                    x/=d;
                    cnt[i]++;
                }
            }
        }
    }

    int i = 1, len = 0;

    f[0] = 0;
    while (i < n) {
        if (a[i] == a[len]) {
            len++;
            f[i] = len;
            i++;
        }
        else
        {
            if (len != 0)
            {
                len = f[len - 1];
            }
            else
            {
                f[i] = 0;
                i++;
            }
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    ifstream cin("tsuk.in");
    ofstream cout("tsuk.out");

    cin >> m;
    for(int i = 0;i<m;i++)
    {
        int d;
        cin >> d;

        usedDigits[d]++;
    }

    cin >> n;
    for(int i = 0;i<n;i++)
    {
        cin >> a[i];
    }

    Init();

    int i = 0;
    int j = 0;
    while (i < MAXN)
    {
        if (a[j] == cnt[i])
        {
            j++;
            i++;
        }

        if (j == n)
        {
            cout << cnt[i] << '\n';
            return 0;
        }

        else if (i < MAXN && a[j] != cnt[i])
        {
            if (j != 0)
                j = f[j - 1];
            else
                i = i + 1;
        }
    }
}