#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int maxm = 52 * 60;
int t[maxm][2], e[maxm], f[maxm], cnt;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int k;
    cin >> k;
    string s;
    cin >> s;
    vector<string> x(k);
    for (auto &i : x)
    {
        cin >> i;
    }
    string a;
    for (char c : s)
    {
        int p = 'A' <= c && c <= 'Z' ? c - 'A' : c - 'a' + 26;
        a += x[p];
    }
    int n = a.size();
    int ox = 0, oy = 0;
    for (auto i : x) if (i == "0") ox = 1; else if (i == "1") oy = 1;
    if (ox && oy) return cout << "-1\n", 0;
    if (!ox && !oy) return cout << n << '\n', 0;
    for (auto &i : x)
    {
        reverse(i.begin(), i.end());
        int p = 0;
        for (char c : i)
        {
            c -= '0';
            if (!t[p][c]) t[p][c] = ++cnt;
            p = t[p][c];
        }
        e[p] = 1;
    }
    queue<int> q;
    for (int i=0;i<2;++i) if (t[0][i]) q.push(t[0][i]);
    while (q.size())
    {
        int u = q.front(); q.pop();
        e[u] |= e[f[u]];
        for (int i=0;i<2;++i)
        {
            if (t[u][i]) f[t[u][i]] = t[f[u]][i], q.push(t[u][i]);
            else t[u][i] = t[f[u]][i];
        }
    }
    int p = 0;
    int ans = 0;
    reverse(a.begin(), a.end());
    for (int i=0;i<n;++i)
    {
        int c = a[i] - '0';
        p = t[p][c];
        if (!e[p])
        {
            ++ans;
            for (int j=i+1;j<n;++j) if ((ox && a[j] == '1') || (oy && a[j] == '0')) ++ans;
            break;
        }
    }
    if (!ans) ans = -1;
    cout << ans << '\n';
    return 0;
}