#include <queue>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

const int KIND = ;

const int MAX_NODE =  * ;

const int MAX_N =  + ;

const int MAX_M =  + ;

char str[MAX_M];

int visited[MAX_N];

int vir_match[MAX_N];

char vir[MAX_N][];

struct Trie {

    int root, count;

    int next[MAX_NODE][KIND], fail[MAX_NODE], end[MAX_NODE];

    void Init()

    {

        count = ;

        root = NewNode();

    }

    int NewNode()

    {

        for (int i = ; i < KIND; ++i)

            next[count][i] = -;

        end[count] = -;

        return count++;

    }

    void Insert(char *str, int id)

    {

        int i = , k = ;

        int now = root;

        while (str[i])

        {

            k = str[i];

            if (next[now][k] == -)

                next[now][k] = NewNode();

            now = next[now][k];

            ++i;

        }

        end[now] = id;

    }

    void BuildAutomaton()

    {

        queue<int> Q;

        fail[root] = -;

        Q.push(root);

        while (!Q.empty())

        {

            int now = Q.front();

            int p = -;

            Q.pop();

            for (int i = ; i < KIND; ++i)

            {

                if (next[now][i] != -)

                {

                    if (now == root)

                        fail[next[now][i]] = root;

                    else

                    {

                        p = fail[now];

                        while (p != -)

                        {

                            if (next[p][i] != -)

                            {

                                fail[next[now][i]] = next[p][i];

                                break;

                            }

                            p = fail[p];

                        }

                        if (p == -)

                            fail[next[now][i]] = root;

                    }

                    Q.push(next[now][i]);

                }

            }

        }

    }

    int Match(char *str)

    {

        int i = , k = , vir_count = ;

        int p = root;

        while (str[i])

        {

            k = str[i];

            while (next[p][k] == - && p != root)

                p = fail[p];

            p = next[p][k];

            p = (p == -) ? root : p;

            int temp = p;

            while (temp != root)

            {

                if (end[temp] != -)

                {

                    if (visited[end[p]] == )

                        vir_match[vir_count++] = end[p];

                    visited[end[p]]++;

                }

                temp = fail[temp];

            }

            ++i;

        }

        return vir_count;

    }

};

Trie root;

int main()

{

    int vir_num = ;

    int match_count = ;

    while (scanf("%d\n", &vir_num) != EOF)

    {

        root.Init();

        memset(vir_match, , sizeof(vir_match));

        memset(visited, , sizeof(visited));

        for (int i = ; i < vir_num; ++i)

        {

            gets(str);

            strcpy(vir[i], str);

            root.Insert(str, i + );

        }

        match_count = ;

        root.BuildAutomaton();

        gets(str);

        int ans = root.Match(str);

        sort(vir_match, vir_match + ans);

        if (ans)

        {

            for (int j = ; j < ans - ; ++j)

                printf("%s: %d\n", vir[vir_match[j] - ], visited[vir_match[j]]);

            printf("%s: %d\n", vir[vir_match[ans - ] - ],

                visited[vir_match[ans - ]]);

        }

    }

    return ;

}