#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
const ll inf = (1e18);
const ll mod = 1000000007;
const vector<int> dy = {-1, 0, 1, 0}, dx = {0, -1, 0, 1};
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll c, ll d) { return c / GCD(c, d) * d; }
struct __INIT {
  __INIT() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} __init;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
void debag(const vector<T> &a) {
  cerr << "debag :";
  for (auto v : a) cerr << v << " ";
  cerr << "\n";
}
template <class T>
void print(const vector<T> &a) {
  for (auto v : a) cout << v << " ";
  cout << "\n";
}
void solve() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  V<int> a(9);
  for (int i = 0; i < 9; i++) cin >> a[i];
  bool ok = false;
  for (int i = 0; i < n; i++) {
    if (!ok && int(s[i] - '0') >= a[int(s[i] - '0') - 1]) continue;
    ok = true;
    if (int(s[i] - '0') > a[int(s[i] - '0') - 1]) break;
    s[i] = char(a[int(s[i] - '0') - 1] + '0');
  }
  cout << s << "\n";
}
int main() {
  int t = 1;
  while (t--) solve();
}
