#include <bits/stdc++.h>
using namespace std;
long long unsigned int countDivisors(long long unsigned int n) {
  long long unsigned int cnt = 0;
  for (long long unsigned int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        ++cnt;
      else
        cnt += 2;
    }
  }
  return cnt;
}
int findFirst(const std::vector<int> &array, int key, int low, int high) {
  int ans = -1;
  while (low <= high) {
    int mid = low + (high - low) / 2;
    if (key == array[mid]) {
      ans = mid;
      high = mid - 1;
    } else if (key > array[mid])
      low = mid + 1;
    else
      high = mid - 1;
  }
  return ans;
}
int findLast(const std::vector<int> &array, int key, int low, int high) {
  int ans = -1;
  while (low <= high) {
    int mid = low + (high - low) / 2;
    if (key == array[mid]) {
      ans = mid;
      low = mid + 1;
    } else if (key > array[mid])
      low = mid + 1;
    else
      high = mid - 1;
  }
  return ans;
}
int d, x, y;
void extendedEuclid(int a, int b) {
  if (b == 0) {
    d = 1;
    x = 1;
    y = 0;
  } else {
    extendedEuclid(b, a % b);
    int temp = x;
    x = y;
    y = temp - (a / b) * y;
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n;
  cin >> n;
  string str;
  cin >> str;
  vector<int> v(9, 0);
  for (int i1 = 0; i1 < 9; i1++) cin >> v[i1];
  int indx1 = -1, indx2 = n;
  for (int i = 0; i < n; i++) {
    int num = str[i] - '0';
    if (v[num - 1] > num) {
      indx1 = i;
      break;
    }
  }
  for (int i = indx1 + 1; i < n; i++) {
    int num = str[i] - '0';
    if (v[num - 1] < num) {
      indx2 = i;
      break;
    }
  }
  if (indx1 > indx2) {
    swap(indx1, indx2);
  }
  if (indx1 == -1) {
    cout << str << endl;
    return 0;
  }
  for (int i = indx1; i < indx2; i++) {
    int num = str[i] - '0';
    int x = v[num - 1];
    str[i] = '0' + x;
  }
  cout << str << endl;
  return 0;
}
