#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
typedef long long LL;
using namespace std;

char u;
void scan(int &x){
	int f=1;
    while(u = getchar(), u < '0' || u > '9'){if(u=='-') f=-1;};
    x = u-'0';
    while(u = getchar(), u >= '0' && u <= '9') x = x * 10 + u -'0';
    x*=f;
}
int main(){
	int n;
	string s;
	scan(n);
	cin >> s;
	for(int i=0; i<=s.size()-1; i++){
		s[i]+=n;
		if(s[i]>'Z') s[i]-=26;
		if(s[i]<'A')s[i]+=26; 
	}
	cout << s;
	return 0;
}


