#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <iostream>
#include <algorithm>
#include <tr1/unordered_map>
using namespace std;
using namespace std::tr1;

int N, nrp;
string val[256];
char var[10];
char S[128];
char format[128];

int main() {
    //freopen("test.in", "r", stdin);
    
    scanf("%d\n", &N);
    for (int i=0; i<N; ++i) {
        string v;
        scanf("%c=", &var[i]);
        cin >> v;
        scanf("\n");
        val[var[i]] = v;
    }
    
    fgets(S, 128, stdin);
    int p = 0;
    for (p=0; S[p]!='\0' && S[p]!=','; ++p);
    
    for (int i=0; S[i]!='\0' && S[i]!=','; ++i) {
        if (S[i] != '%')
            printf("%c", S[i]);
        else {
            ++i;
            if (S[i] == 's') {
                ++p;
                printf("%s", val[S[p]].c_str());
                ++p;
                }
            else if (S[i] == '.') {
                ++i;
                sscanf(S+i, "%d", &nrp);
                sprintf(format, "%%.%df", nrp);
                ++p;
                printf(format, atof(val[S[p]].c_str()));
                ++p;
                while (nrp) {
                    ++i;
                    nrp /= 10;
                }
            } else {
                sscanf(S+i, "%d", &nrp);
                sprintf(format, "%%%dd", nrp);
                ++p;
                printf(format, atoi(val[S[p]].c_str()));
                ++p;
                while (nrp) {
                    ++i;
                    nrp /= 10;
                }
            }
        }
    }
    
    return 0;
}