// #undef LOCAL

#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif

#ifdef LOCAL
// #define _GLIBCXX_DEBUG
#include "../algo/debug.hpp"
#else
#define debug(...) void(0)
#endif

#include <bits/stdc++.h>
using namespace std;

#if __has_include(<atcoder/all>)
#include <atcoder/all>
// using namespace atcoder;
#endif

constexpr int inf = (1<<30) - 1;
constexpr long long linf = (1LL<<60) - 1;
using ll = long long;
using ld = long double;
#define len(x) int((x).size())
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define LB(c, x) distance(begin(c), lower_bound(all(c), x))
#define UB(c, x) distance(begin(c), upper_bound(all(c), x))
template <typename F> ll binary_search(F check, ll ok, ll ng, bool CHECK = true) { if(CHECK) assert(check(ok)); while(abs(ok - ng) > 1) { ll mi = (ok + ng) / 2; (check(mi) ? ok : ng) = mi; } return ok; }
template <typename T, typename S> auto min(const T& a, const S& b) { return(a < b ? a : b); }
template <typename T, typename S> auto max(const T& a, const S& b) { return(a > b ? a : b); }
template <typename T, typename S> inline bool chmax(T& a, const S& b) { return(a < b ? a = b, 1 : 0); }
template <typename T, typename S> inline bool chmin(T& a, const S& b) { return(a > b ? a = b, 1 : 0); }
// ------------------------------------------------------------------

void solve() {
    int n; cin >> n;
    string s; cin >> s;
    vector<int> p(n);
    for(int i = 0; i < n; i++) cin >> p[i];
    string t = "";
    for(int i = 0; i < n; i++) t += s[p[i] - 1];
    cout << t << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    // fixed(cout).precision(12);
    int T = 1;
    // cin >> T;
    while(T--) {
        solve();
    }
}