#include <bits/stdc++.h>
using namespace std;
bool is_palindrome(const string &s, int start, int end) {
  int sz = end - start + 1;
  if (sz % 2 == 0) {
    int middle = start + sz / 2;
    int i;
    for (i = 0; middle - 1 - i >= 0 && middle + i <= end &&
                s[middle - 1 - i] == s[middle + i];
         i++)
      ;
    if (middle - i - 1 < 0 || middle + i > end) return true;
  } else {
    int middle = start + sz / 2;
    int i;
    for (i = 1;
         middle - i >= 0 && middle + i <= end && s[middle - i] == s[middle + i];
         i++)
      ;
    if (middle - i < 0 || middle + i > end) return true;
  }
  return false;
}
int euclidd, euclidx, euclidy;
void extendedeuclid(int a, int b) {
  if (b == 0) {
    euclidd = a;
    euclidx = 1;
    euclidy = 0;
    return;
  }
  extendedeuclid(b, a % b);
  int d1, x1, y1;
  d1 = euclidd;
  x1 = euclidx;
  y1 = euclidy;
  euclidx = y1;
  euclidy = x1 - ((a / b) * y1);
}
double area_triangle(double x1, double y1, double x2, double y2, double x3,
                     double y3) {
  double a;
  a = x1 * (y2 - y3) + y1 * (x3 - x2) + ((x2 * y3) - (y2 * x3)) + 1e-9;
  a = a / 2 + 1e-9;
  return a;
}
double dist_2point(double x1, double y1, double x2, double y2) {
  double d;
  d = sqrt(pow((x1 - x2), 2) + pow((y1 - y2), 2));
  return d;
}
int binary_search(int a[], int n, int l, int u) {
  int mid;
  if (l > u) return 0;
  mid = floor(l + u) / 2;
  if (a[mid] == n)
    return mid;
  else if (a[mid] > n)
    binary_search(a, n, l, mid - 1);
  else
    binary_search(a, n, mid + 1, u);
}
long gcd(long a, long b) {
  while (b > 0) {
    a = a % b;
    a = a ^ b;
    b = b ^ a;
    a = a ^ b;
  }
  return a;
}
long lcm(long a, long b) {
  long x = (a * b) / gcd(a, b);
  return x;
}
long is_prime(long n) {
  long ii;
  if (n == 1) return 0;
  if (n == 2) return 1;
  if (n % 2 == 0) return 0;
  for (ii = 3; ii * ii <= n; ii = ii + 2)
    if (n % ii == 0) return 0;
  return 1;
}
long long bigmod(long long b, long long p, long long m) {
  if (b == 0) return 0;
  long long x, power;
  x = 1;
  power = b % m;
  while (p) {
    if (p % 2 == 1) x = (x * power) % m;
    power = (power * power) % m;
    p = p / 2;
  }
  return x;
}
int main() {
  ios_base::sync_with_stdio(false);
  string s[200], w, s1;
  long n;
  while (cin >> n) {
    long i, j, color[200] = {0}, l;
    map<string, int> mp;
    char ch;
    for (i = 0; i < n; i++) {
      cin >> s[i];
      transform(s[i].begin(), s[i].end(), s[i].begin(), (int (*)(int))tolower);
      mp[s[i]] = 1;
    }
    cin >> w;
    s1 = w;
    transform(w.begin(), w.end(), w.begin(), (int (*)(int))tolower);
    cin >> ch;
    long le = w.size();
    for (i = 0; i < le; i++) {
      for (j = 1; j <= le - i; j++) {
        string p;
        p = w.substr(i, j);
        if (mp[p]) {
          for (int b = i; b <= j + i - 1; b++) color[b] = 1;
        }
      }
    }
    char ch1;
    if (ch < 97) {
      ch1 = ch;
      ch = ch + 32;
    } else {
      ch1 = ch - 32;
    }
    for (i = 0; i < w.size(); i++) {
      if (color[i]) {
        if (s1[i] == ch || s1[i] == ch1) {
          if (s1[i] == 'a' || s1[i] == 'A') {
            if (s1[i] >= 97)
              s1[i] = 98;
            else
              s1[i] = 66;
          } else {
            if (s1[i] >= 97)
              s1[i] = 97;
            else
              s1[i] = 65;
          }
        } else {
          if (s1[i] < 97)
            s1[i] = ch1;
          else
            s1[i] = ch;
        }
      }
    }
    cout << s1 << endl;
  }
  return 0;
}
