#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

void A() {
  string str;
  vector<int> vec;
  cin >> str;
  int len = SZ(str);
  rep (i, 0, len - 1) {
    if (i && str[i] == str[i - 1]) vec.emplace_back(0);
    vec.emplace_back(str[i] - 'a' + 1);
  }
  int n;
  vector<int> a(n, 0);
  cin >> n;
  for (int &x : a) cin >> x;
  int block = n / SZ(vec);
  int l = 0, r = -1;
  vector<int> res(0);
  for (int x : vec) {
    l = r + 1;
    r = min(n - 1, l + block - 1);
    rep (i, l, r) if (a[i] % 27 == x) res.emplace_back(a[i]);
  }
  cout << SZ(res) << '\n';
  for (int x : res) cout << x << ' ';
  cout << '\n';
}

void E() {
  int n;
  cin >> n;
  vector<int> a(n, 0);
  for (int &x : a) cin >> x, x %= 27;
  for (int l = 0, r; l < n; l = r + 1) {
    r = l;
    while (r + 1 < n && a[r + 1] == a[r]) r++;
    if (a[l] != 0) cout << char('a' + a[l] - 1);
  }
  cout << '\n';
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  string name;
  cin >> name;
  if (name == "Alisa") A();
  else E();
}