#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ll)rng() % B;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string s; cin >> s;
    if (s == "Alisa") {
        string str; cin >> str;
        int n; cin >> n;
        vector<int> x(n);
        for (int i = 0; i < n; ++i) {
            cin >> x[i];
        }
        vector<int> y;
        int j = 0;
        for (int i = 0; i < (int)str.size(); ++i) {
            int bit = str[i]-'a'+1;
            for (int k = 0; k < 100; ++k) {
                while (j < n) {
                    if (((1<<bit)&x[j]) and x[j]%2 == 0) {
                        y.push_back(x[j]);
                        j += 1;
                        break;
                    }
                    j += 1;
                }
            }
            if (i+1 < (int)str.size()) {
                for (int k = 0; k < 100; ++k) {
                    while (j < n) {
                        if ((1<<0)&x[j]) {
                            y.push_back(x[j]);
                            j += 1;
                            break;
                        }
                        j += 1;
                    }
                }
            }
        }
        if (0) {
            cout << "Eva" << endl;
            vector<int> yy;
            for (int i = 0; i < y.size(); ++i) {
                if (myRand(1e9)%2 == 0) yy.push_back(y[i]);
            }
            swap(y, yy);
            cout << y.size() << "\n";
            for (int i = 0; i < y.size(); ++i) {
                if (i) cout << " ";
                cout << y[i];
            }
            cout << "\n";
        }
        if (1) {
            cout << y.size() << "\n";
            for (int i = 0; i < y.size(); ++i) {
                if (i) cout << " ";
                cout << y[i];
            }
            cout << "\n";
        }
    }
    else {
        int n; cin >> n;
        vector<int> x(n);
        for (int i = 0; i < n; ++i) {
            cin >> x[i];
        }
        string res;
        x.push_back(1);
        n += 1;
        for (int i = 0; i < n;) {
            map<int,int> mp;
            while (i < n and (x[i]&1) == 0) {
                for (int j = 0; j < 30; ++j) {
                    if ((1LL<<j)&x[i]) mp[j] += 1;
                }
                i += 1;
            }
            int mx = 0;
            for (int j = 0; j < 30; ++j) {
                if (mp[j] > mp[mx]) mx = j;
            }
            res += (char)('a'+mx-1);
            while (i < n and (x[i]&1) == 1) {
                i += 1;
            }
        }
        cout << res << endl;
    }
}