Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		n := io.NextInt()
		if n == 0 {
			break
		}
		k := make([]int, n)
		for i := 0; i < n; i++ {
			k[i] = io.NextInt()
		}
		const st = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
		s := io.NextLine()
		for i, cnt := 0, 0; i < len(s); i, cnt = i+1, (cnt+1)%n {
			idx := strings.IndexRune(st, rune(s[i]))
			c := st[(idx-k[cnt]+52)%52]
			io.Printf("%c", c)
		}
		io.Println()
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := make([]interface{}, 0, len(a))
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := make([]interface{}, 0, len(a))
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <string>

using namespace std;

int main(){
	int n;
	string s;
	while(cin >> n, n){
		vector<int> key(n);
		for(int i = 0; i < n; i++){
			cin >> key[i];
		}
		cin >> s;
		
		for(int i = 0; i < s.size(); i++){
			int tmp = i % n;
			s[i] = s[i] - key[tmp];
			if('Z' < s[i] && s[i] < 'a'){
				s[i] = 'Z' + (s[i] - 'a') + 1;
			}
			if(s[i] < 'A'){
				s[i] = 'z' + (s[i] - 'A') + 1;
			}
		}
		cout << s << endl;
	}
	return 0;
}

C++: #include <cctype>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

char solve(char c, int k) {
    if (islower(c)) {
        char x = c - k;
        if (x < 'a') {
            return 'Z' - ('a' - x) + 1;
        }
        return x;
    }
    else {
        char x = c - k;
        if (x < 'A') {
            return 'z' - ('A' - x) + 1;
        }
        return x;
    }
}

int main() {
    int n;
    while (cin >> n, n) {
        vector<int> k(n);
        for (int& x : k) cin >> x;
        string s;
        cin >> s;
        for (int i = 0; i < s.size(); ++i) {
            cout << solve(s[i], k[i % n]);
        }
        cout << endl;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

//define
#define ALL(a) a.begin(),a.end()
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define debug(x) if(1) cout<<#x<<":"<<x<<endl;
#define DEBUG(x) if(1) cout<<#x<<":"<<x<<endl;
#define ll long long

//constant
const int MOD=1000000007;
const int INF=INT_MAX/3-1;
const double EPS=1e-9;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};

//typedef
typedef vector<int> vi;
typedef vector<vector<int>> vvi;




int main(){
    int n;
    string s;
    string cir="";
    for(int i=0;i<='z'-'a';i++)
        cir+='a'+i;
    for(int i=0;i<='Z'-'A';i++)
        cir+='A'+i;
    while(cin>>n,n){
        vi k(n);
        REP(i,n)
            cin>>k[i];
        cin>>s;
        REP(i,s.size()){
            int j;
            for(j=0;j<52;j++)
                if(cir[j]==s[i])
                    break;
            s[i]=cir[(j-k[i%n]+2*52)%52];


        }
        cout<<s<<endl;


    }



}

C++: #include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#include <cstring>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
int main(){
    int n;
    char hoge[]={"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"};
    int hoge_size=(int)strlen(hoge);
    map<char,int>mp;
    rep(i,hoge_size){
        mp[hoge[i]]=i;
    }
    while(cin>>n,n){
        vi key(n); rep(i,n)cin>>key[i];
        string s; cin>>s;
        string ans;
        int cnt=0;
        for(int i=0; i<s.size();i++){
            int gotiusa=mp[s[i]]-key[cnt];
            if(gotiusa<0)gotiusa+=52;
            cout<<hoge[gotiusa];
            cnt++;
            if(cnt==key.size())cnt=0;
        }
        cout<<endl;
    }
}

C++: /*
Hokudai Practice Contest 2014
A - King's Inspection

ティツァツ」テヲツウツ陛ッツシツ堙」ツつキテ」ツδ淌」ツδ・テ」ツδャテ」ツδシテ」ツつキテ」ツδァテ」ツδウ
テヲツ崢クテ」ツ?凝」ツつ古」ツ?ヲテ」ツ??」ツつ凝」ツδォテ」ツδシテ」ツδォテ」ツ?ォテ・ツセツ禿」ツ?」テ」ツ?ヲテ・ツセツゥテ・ツ?ε」ツ?凖」ツつ凝」ツ??」ツ?妥」ツ??
テ」ツδォテ」ツδシテ」ツδォテ」ツつ津・ツ?催ァツ渉セテ」ツ?凖」ツつ凝」ツ?淌」ツつ?」ツ?ォテ」ツ?ッテ」ツδェテ」ツつケテ」ツδ暗」ツ?ョテ・ツセツェテァツ陳ーテ」ツつ?ヲツ鳴?・ツュツ療」ツ?ョテ・ツセツェテァツ陳ーテ」ツつ津・ツ?催ァツ渉セテ」ツ?凖」ツつ凝・ツソツ?ィツヲツ?」ツ?古」ツ?づ」ツつ凝」ツ??
(M-1)+1 -> 0, 0-1 -> (M-1)テ」ツ??」ツ?ィテ」ツ?ェテ」ツつ凝」ツつ暗」ツ??」ツ?ォテ」ツ?凖」ツつ凝」ツ?ォテ」ツ?ッテ」ツ??・ツ可ーテ、ツスツ?%)テ」ツつ津ァツ板ィテ」ツ??」ツつ古」ツ?ーテ」ツつ暗」ツ??」ツ??

テヲツ卍づゥツ鳴禿ィツィツ暗ァツョツ療ゥツ?湘ッツシツ唹(|s|)
テァツゥツコテゥツ鳴禿ィツィツ暗ァツョツ療ゥツ?湘ッツシツ唹(n + |s|)
*/

#include<iostream>
#include<cctype>
using namespace std;

//a-zA-z -> テゥツ??ァツ閉ェ
int toInt(char a){
  if(islower(a))return a-'a';
  return a-'A'+26;
}

//テゥツ??ァツ閉ェ -> a-zA-Z
char toChar(int a){
  if(a<26)return 'a'+a;
  return 'A'+a-26;
}

//テゥツァツ?ヲツ閉ー
const int M = 52;

int main(){
  int n,k[100];
  string s;

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

    for(int i=0;i<(int)s.size();i++){
      //テ・ツセツェテァツ陳ーテ」ツつ津」ツつキテ」ツδ淌」ツδ・テ」ツδャテ」ツδシテ」ツつキテ」ツδァテ」ツδウテ」ツ?凖」ツつ凝」ツ?ォテ」ツ?ッmodテ」ツつ津、ツスツソテ」ツ?暗」ツ?ーティツ可ッテ」ツ??
      int tmp = toInt(s[i]) - k[i%n];
      //ティツイツ?ヲツ閉ーテ」ツつづ」ツ?づ」ツつ甘・ツセツ療」ツつ凝・ツ?エテ・ツ青暗」ツ?ョテ・ツョツ嘉・ツ?ィテ」ツ?ェmodテ」ツ?ョテ・ツ渉姪」ツつ甘ヲツ鳴ケテ」ツ?ッ((x%mod) + mod)%mod
      tmp = ((tmp%M) + M) % M;
      cout << toChar(tmp);
    }
    cout << endl;
  }
}