#include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 29;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };


int main() {
	int n;
	VI _array;
	string str;
	while ( ~scanf( "%d", &n ) && n ) {
		_array.resize( n );
		for ( int i = 0; i < n; i++ ) {
			scanf( "%d", &_array[ i ] );
			_array[ i ] %= 52;
		}
		cin >> str;
		for ( int i = 0; i < str.size(); i++ ) {
			for ( int j = 0; j < _array[ i % n ]; j++ ) {
				if ( str[ i ] - 1 < 'a' && ( str[ i ] < 'A' || str[ i ] > 'Z' ) ) {
					str[ i ] = 'Z';
				}
				else if ( str[ i ] - 1 < 'A' && ( str[ i ] < 'a' || str[ i ] > 'z' ) ) {
					str[ i ] = 'z';
				}
				else {
					str[ i ]--;
				}
			}
		}
		printf( "%s\n", str.c_str() );
	}
	return 0;
}
#include <iostream>
#include <map>
using namespace std;

string Alpha = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
int l = 52;

int main(void) {
    int n, x, d;
    int k[1000];
    string s;
    map<char, int> mp;
    for (int i = 0; i < 52; i++) mp[Alpha[i]] = i;

    while (1) {
        cin >> n;
        if (n == 0) break;

        for (int i = 0; i < n; i++) cin >> k[i];
        cin >> s;

        for (int i = 0; i < s.size(); i++) {
            d = k[i % n];
            x = (mp[s[i]] + 52 - d) % l;
            cout << Alpha[x];
        }
        cout << endl;
    }

    return 0;
}