#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
#include <limits>
#include <array>

static const int MOD = 998244353;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;


int main() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    string t(s.size(), '0');
    vector<int> P(n);
    for (auto &&i : P) scanf("%d", &i);
    for (int i = 0; i < n; ++i) {
        t[i] = s[P[i]-1];
    }
    cout << t << "\n";
    return 0;
}