stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



const int N = ((int)(1e6))+20;



int a,s,it = 0;

char tab[N];



int main(){

	cin>>s;

	while( cin>>tab[it] ) it++;

	for (int i = 0; i < it; i++){

		int num = int(tab[i]) - int('A');

		num+=s;

		num %= 26;

		cout<<char(int('A') + num);

	}	

}


// Faster C++ solution for the same problem (measured speedup: 5.2054160329671575x):
#include <stdio.h>



int main(){

    int a;

    char c[10000];

    scanf("%d",&a);

    getchar();

    

    scanf("%[^\n]", c);

    

    for (int i=0; c[i]!='\0'; i++){

        if(c[i]>='A' && c[i]<='Z'){

            c[i]+=a;

            if(c[i]>90){

                c[i]-=26;

            }

            printf("%c",c[i]);

        }

    }

}
// Slower C++ solution:
#include <iostream>

#include <string.h>

using namespace std;



int main()

{

long long int N;

cin >> N;

string S;

cin >> S;

long long int i;

for(i=0;S[i] != '\0';i++)

{

    if((S[i]+N) > 90)

            S[i]=((S[i]+N)-90)+64;

    else

        S[i]+=N;

}

cout << S;

}


// Faster C++ solution for the same problem (measured speedup: 5.212459582152295x):
#include <stdio.h>



int main(){

    int a;

    char c[10000];

    scanf("%d",&a);

    getchar();

    

    scanf("%[^\n]", c);

    

    for (int i=0; c[i]!='\0'; i++){

        if(c[i]>='A' && c[i]<='Z'){

            c[i]+=a;

            if(c[i]>90){

                c[i]-=26;

            }

            printf("%c",c[i]);

        }

    }

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

    int n,i;

    string s;

    cin>>n>>s;

    for(i=0;i<s.length();i++){

        if('Z'-s[i]>=n){s[i]=s[i]+n;}

        else{s[i]=n-26+s[i];}

    }

    cout<<s<<endl;

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.276271401147098x):
#include <stdio.h>



int main(){

    int a;

    char c[10000];

    scanf("%d",&a);

    getchar();

    

    scanf("%[^\n]", c);

    

    for (int i=0; c[i]!='\0'; i++){

        if(c[i]>='A' && c[i]<='Z'){

            c[i]+=a;

            if(c[i]>90){

                c[i]-=26;

            }

            printf("%c",c[i]);

        }

    }

}
// Slower C++ solution:
#include<bits/stdc++.h>

#include<math.h>

using namespace std;

int main()

{

    long long int a=1,b,n,i,j,sum=0;

    string s,s1;

    cin>>n>>s;

    for(i=0;i<s.size();i++)

    {

        a=s[i]-'A';

        b=(a+n)%26;

        s[i]='A'+b;

        cout<<s[i];

    }



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.217617762217515x):
#include <stdio.h>



int main(){

    int a;

    char c[10000];

    scanf("%d",&a);

    getchar();

    

    scanf("%[^\n]", c);

    

    for (int i=0; c[i]!='\0'; i++){

        if(c[i]>='A' && c[i]<='Z'){

            c[i]+=a;

            if(c[i]>90){

                c[i]-=26;

            }

            printf("%c",c[i]);

        }

    }

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main(){

    int k;

    cin>>k;

    string s;

    cin>>s;

    for (int i = 0; i< s.size(); i++){

        s[i] += k;

        if (s[i] > 'Z'){

            s[i] = 64 + (s[i] - 'Z');

        }

    }

    cout<<s;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.254750372533825x):
#include <stdio.h>



int main(){

    int a;

    char c[10000];

    scanf("%d",&a);

    getchar();

    

    scanf("%[^\n]", c);

    

    for (int i=0; c[i]!='\0'; i++){

        if(c[i]>='A' && c[i]<='Z'){

            c[i]+=a;

            if(c[i]>90){

                c[i]-=26;

            }

            printf("%c",c[i]);

        }

    }

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

vector<int>v;

int main()

{

  int n,k;

  cin>>n;

  string s;

  cin>>s;

  for(int i=0;i<s.size();i++)

  {

     v.push_back(s[i]);

  }

  for(int i=0;i<s.size();i++)

  {

      k=v[i]+n;

    if(k<=90)

        cout<<char(k);

    else

    {

        cout<<char(k-26);

    }

  }

  cout<<endl;



}


// Faster C++ solution for the same problem (measured speedup: 5.28880031331467x):
#include <stdio.h>



int main(){

    int a;

    char c[10000];

    scanf("%d",&a);

    getchar();

    

    scanf("%[^\n]", c);

    

    for (int i=0; c[i]!='\0'; i++){

        if(c[i]>='A' && c[i]<='Z'){

            c[i]+=a;

            if(c[i]>90){

                c[i]-=26;

            }

            printf("%c",c[i]);

        }

    }

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef vector<int> vi;

typedef vector<string> vs;

typedef vector<double> vd;

typedef set<int> si;

typedef set<string> ss;

typedef map<int,int> mii;

typedef map<string,int>msi;

typedef map<string,string>mss;

void solve(){

    string inp,res="";

    int n;

    cin>>n;

    cin>>inp;

    for(int i=0;i<inp.size();i++){

        char ch = inp[i];

        ch+=n;

        if(ch>'Z'){

            ch-=26;

        }

        res+=ch;

    }

    cout<<res<<endl;

}

int main(){

    int t;

    t=1;

    while(t--){

       solve();

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.271551148011196x):
#include <stdio.h>



int main(){

    int a;

    char c[10000];

    scanf("%d",&a);

    getchar();

    

    scanf("%[^\n]", c);

    

    for (int i=0; c[i]!='\0'; i++){

        if(c[i]>='A' && c[i]<='Z'){

            c[i]+=a;

            if(c[i]>90){

                c[i]-=26;

            }

            printf("%c",c[i]);

        }

    }

}
// Slower C++ solution:
/*=============================================================================================================================/*

                                               Bismillahir Rahmanir Rahim



      _     ____  ___  ____   _   _  _         ___  ____   _         _     __  __

     / \   / ___||_ _|| __ ) | | | || |       |_ _|/ ___| | |       / \   |  \/  |

    / _ \  \___ \ | | |  _ \ | | | || |        | | \___ \ | |      / _ \  | |\/| |

   / ___ \  ___) || | | |_) || |_| || |___     | |  ___) || |___  / ___ \ | |  | |

  /_/   \_\|____/|___||____/  \___/ |_____|   |___||____/ |_____|/_/   \_\|_|  |_|



   _   __           __  __  __

  |_) (_  _  o__   /   (_  |_

  |_)o__)(_  || |  \__ __) |__



    ___                    _   _      _                _ _               __   ___                 _         _        _

   / __|_ _ ___ ___ _ _   | | | |_ _ (_)_ _____ _ _ __(_) |_ _  _   ___ / _| | _ ) __ _ _ _  __ _| |__ _ __| |___ __| |_

  | (_ | '_/ -_) -_) ' \  | |_| | ' \| \ V / -_) '_(_-< |  _| || | / _ \  _| | _ \/ _` | ' \/ _` | / _` / _` / -_|_-< ' \

   \___|_| \___\___|_||_|  \___/|_||_|_|\_/\___|_| /__/_|\__|\_, | \___/_|   |___/\__,_|_||_\__, |_\__,_\__,_\___/__/_||_|

                                                            |__/                           |___/





   FB: https://facebook.com/SIAsibul

   Gmail: asibulislam8@gmail.com



/*=============================================================================================================================*/



#include<bits/stdc++.h>

using namespace std;



typedef long long ll;

typedef unsigned long long ull;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef pair<int, int> pii;

typedef pair<ll, ll> pll;

typedef pair<ll, int> pli;

typedef pair<int, ll> pil;

typedef vector<pii> vii;

typedef vector<pil> vil;

typedef vector<pli> vli;

typedef vector<pll> vll;



#define ff first

#define ss second

#define pb push_back

#define mp make_pair

#define sz size()

#define all(a)  a.begin(), a.end()

#define mem(a, b)     memset(a, b, sizeof(a))

#define f0(i,n) for(int i=0;i<(n);i++)

#define f1(i,n) for(int i=1;i<=(n);i++)

#define f2(i,a,n) for(int i=(a);i<=(n);i++)

#define fr(i,n,a) for(int i=(n);i>=(a);i--)

#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))

#define nl "\n"





const int INF = 1e9 + 5;

const int MXN = 2e5 + 5;





int main(){

    int n;

    cin >> n;



    string s;

    cin >> s;



    f0(i, s.size())

        s[i] = (s[i] - 'A' + n) % 26 + 'A';



    cout << s << nl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.264190486096367x):
#include <stdio.h>



int main(){

    int a;

    char c[10000];

    scanf("%d",&a);

    getchar();

    

    scanf("%[^\n]", c);

    

    for (int i=0; c[i]!='\0'; i++){

        if(c[i]>='A' && c[i]<='Z'){

            c[i]+=a;

            if(c[i]>90){

                c[i]-=26;

            }

            printf("%c",c[i]);

        }

    }

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

#define     LL              long long int

#define     FOR(I,A,B)      for( int I = A; I < B; ++I )

#define     SFI(X)          scanf("%d",&X)

#define     SFL(X)          scanf("%lld",&X)





int main() {



    int n;

    string s;



    scanf("%d",&n);

    cin >> s;



    for(int i=0;i<s.length();i++){

        s[i] = (s[i] - 'A' + n) % 26 + 'A';

    }



    cout << s << endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.24648279065261x):
#include <stdio.h>



int main(){

    int a;

    char c[10000];

    scanf("%d",&a);

    getchar();

    

    scanf("%[^\n]", c);

    

    for (int i=0; c[i]!='\0'; i++){

        if(c[i]>='A' && c[i]<='Z'){

            c[i]+=a;

            if(c[i]>90){

                c[i]-=26;

            }

            printf("%c",c[i]);

        }

    }

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



const int N = ((int)(1e6))+20;



int a,s,it = 0;

char tab[N];



int main(){

	cin>>s;

	while( cin>>tab[it] ) it++;

	for (int i = 0; i < it; i++){

		int num = int(tab[i]) - int('A');

		num+=s;

		num %= 26;

		cout<<char(int('A') + num);

	}	

}


// Faster C++ solution for the same problem (measured speedup: 5.219826502296789x):
#include <stdio.h>



int main (){

	int n;

	scanf("%d", &n);

	

	char kata[10001];

	scanf ("%s", kata);

	

	for (int i =0; kata[i] != '\0'; i++){

		if (kata[i] + n > 'Z'){

			printf("%c", kata[i] + n - 26);

		}

		else {

			printf("%c", kata[i] + n);

		}

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string.h>

using namespace std;



int main()

{

long long int N;

cin >> N;

string S;

cin >> S;

long long int i;

for(i=0;S[i] != '\0';i++)

{

    if((S[i]+N) > 90)

            S[i]=((S[i]+N)-90)+64;

    else

        S[i]+=N;

}

cout << S;

}


// Faster C++ solution for the same problem (measured speedup: 5.226889550566892x):
#include <stdio.h>



int main (){

	int n;

	scanf("%d", &n);

	

	char kata[10001];

	scanf ("%s", kata);

	

	for (int i =0; kata[i] != '\0'; i++){

		if (kata[i] + n > 'Z'){

			printf("%c", kata[i] + n - 26);

		}

		else {

			printf("%c", kata[i] + n);

		}

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

    int n,i;

    string s;

    cin>>n>>s;

    for(i=0;i<s.length();i++){

        if('Z'-s[i]>=n){s[i]=s[i]+n;}

        else{s[i]=n-26+s[i];}

    }

    cout<<s<<endl;

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.290878023695519x):
#include <stdio.h>



int main (){

	int n;

	scanf("%d", &n);

	

	char kata[10001];

	scanf ("%s", kata);

	

	for (int i =0; kata[i] != '\0'; i++){

		if (kata[i] + n > 'Z'){

			printf("%c", kata[i] + n - 26);

		}

		else {

			printf("%c", kata[i] + n);

		}

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#include<math.h>

using namespace std;

int main()

{

    long long int a=1,b,n,i,j,sum=0;

    string s,s1;

    cin>>n>>s;

    for(i=0;i<s.size();i++)

    {

        a=s[i]-'A';

        b=(a+n)%26;

        s[i]='A'+b;

        cout<<s[i];

    }



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.232062010335244x):
#include <stdio.h>



int main (){

	int n;

	scanf("%d", &n);

	

	char kata[10001];

	scanf ("%s", kata);

	

	for (int i =0; kata[i] != '\0'; i++){

		if (kata[i] + n > 'Z'){

			printf("%c", kata[i] + n - 26);

		}

		else {

			printf("%c", kata[i] + n);

		}

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main(){

    int k;

    cin>>k;

    string s;

    cin>>s;

    for (int i = 0; i< s.size(); i++){

        s[i] += k;

        if (s[i] > 'Z'){

            s[i] = 64 + (s[i] - 'Z');

        }

    }

    cout<<s;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.26929741711176x):
#include <stdio.h>



int main (){

	int n;

	scanf("%d", &n);

	

	char kata[10001];

	scanf ("%s", kata);

	

	for (int i =0; kata[i] != '\0'; i++){

		if (kata[i] + n > 'Z'){

			printf("%c", kata[i] + n - 26);

		}

		else {

			printf("%c", kata[i] + n);

		}

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

vector<int>v;

int main()

{

  int n,k;

  cin>>n;

  string s;

  cin>>s;

  for(int i=0;i<s.size();i++)

  {

     v.push_back(s[i]);

  }

  for(int i=0;i<s.size();i++)

  {

      k=v[i]+n;

    if(k<=90)

        cout<<char(k);

    else

    {

        cout<<char(k-26);

    }

  }

  cout<<endl;



}


// Faster C++ solution for the same problem (measured speedup: 5.303441620411526x):
#include <stdio.h>



int main (){

	int n;

	scanf("%d", &n);

	

	char kata[10001];

	scanf ("%s", kata);

	

	for (int i =0; kata[i] != '\0'; i++){

		if (kata[i] + n > 'Z'){

			printf("%c", kata[i] + n - 26);

		}

		else {

			printf("%c", kata[i] + n);

		}

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef vector<int> vi;

typedef vector<string> vs;

typedef vector<double> vd;

typedef set<int> si;

typedef set<string> ss;

typedef map<int,int> mii;

typedef map<string,int>msi;

typedef map<string,string>mss;

void solve(){

    string inp,res="";

    int n;

    cin>>n;

    cin>>inp;

    for(int i=0;i<inp.size();i++){

        char ch = inp[i];

        ch+=n;

        if(ch>'Z'){

            ch-=26;

        }

        res+=ch;

    }

    cout<<res<<endl;

}

int main(){

    int t;

    t=1;

    while(t--){

       solve();

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.286144703196198x):
#include <stdio.h>



int main (){

	int n;

	scanf("%d", &n);

	

	char kata[10001];

	scanf ("%s", kata);

	

	for (int i =0; kata[i] != '\0'; i++){

		if (kata[i] + n > 'Z'){

			printf("%c", kata[i] + n - 26);

		}

		else {

			printf("%c", kata[i] + n);

		}

	}

	

	return 0;

}
// Slower C++ solution:
/*=============================================================================================================================/*

                                               Bismillahir Rahmanir Rahim



      _     ____  ___  ____   _   _  _         ___  ____   _         _     __  __

     / \   / ___||_ _|| __ ) | | | || |       |_ _|/ ___| | |       / \   |  \/  |

    / _ \  \___ \ | | |  _ \ | | | || |        | | \___ \ | |      / _ \  | |\/| |

   / ___ \  ___) || | | |_) || |_| || |___     | |  ___) || |___  / ___ \ | |  | |

  /_/   \_\|____/|___||____/  \___/ |_____|   |___||____/ |_____|/_/   \_\|_|  |_|



   _   __           __  __  __

  |_) (_  _  o__   /   (_  |_

  |_)o__)(_  || |  \__ __) |__



    ___                    _   _      _                _ _               __   ___                 _         _        _

   / __|_ _ ___ ___ _ _   | | | |_ _ (_)_ _____ _ _ __(_) |_ _  _   ___ / _| | _ ) __ _ _ _  __ _| |__ _ __| |___ __| |_

  | (_ | '_/ -_) -_) ' \  | |_| | ' \| \ V / -_) '_(_-< |  _| || | / _ \  _| | _ \/ _` | ' \/ _` | / _` / _` / -_|_-< ' \

   \___|_| \___\___|_||_|  \___/|_||_|_|\_/\___|_| /__/_|\__|\_, | \___/_|   |___/\__,_|_||_\__, |_\__,_\__,_\___/__/_||_|

                                                            |__/                           |___/





   FB: https://facebook.com/SIAsibul

   Gmail: asibulislam8@gmail.com



/*=============================================================================================================================*/



#include<bits/stdc++.h>

using namespace std;



typedef long long ll;

typedef unsigned long long ull;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef pair<int, int> pii;

typedef pair<ll, ll> pll;

typedef pair<ll, int> pli;

typedef pair<int, ll> pil;

typedef vector<pii> vii;

typedef vector<pil> vil;

typedef vector<pli> vli;

typedef vector<pll> vll;



#define ff first

#define ss second

#define pb push_back

#define mp make_pair

#define sz size()

#define all(a)  a.begin(), a.end()

#define mem(a, b)     memset(a, b, sizeof(a))

#define f0(i,n) for(int i=0;i<(n);i++)

#define f1(i,n) for(int i=1;i<=(n);i++)

#define f2(i,a,n) for(int i=(a);i<=(n);i++)

#define fr(i,n,a) for(int i=(n);i>=(a);i--)

#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))

#define nl "\n"





const int INF = 1e9 + 5;

const int MXN = 2e5 + 5;





int main(){

    int n;

    cin >> n;



    string s;

    cin >> s;



    f0(i, s.size())

        s[i] = (s[i] - 'A' + n) % 26 + 'A';



    cout << s << nl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.278763664313977x):
#include <stdio.h>



int main (){

	int n;

	scanf("%d", &n);

	

	char kata[10001];

	scanf ("%s", kata);

	

	for (int i =0; kata[i] != '\0'; i++){

		if (kata[i] + n > 'Z'){

			printf("%c", kata[i] + n - 26);

		}

		else {

			printf("%c", kata[i] + n);

		}

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

#define     LL              long long int

#define     FOR(I,A,B)      for( int I = A; I < B; ++I )

#define     SFI(X)          scanf("%d",&X)

#define     SFL(X)          scanf("%lld",&X)





int main() {



    int n;

    string s;



    scanf("%d",&n);

    cin >> s;



    for(int i=0;i<s.length();i++){

        s[i] = (s[i] - 'A' + n) % 26 + 'A';

    }



    cout << s << endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.261006947581533x):
#include <stdio.h>



int main (){

	int n;

	scanf("%d", &n);

	

	char kata[10001];

	scanf ("%s", kata);

	

	for (int i =0; kata[i] != '\0'; i++){

		if (kata[i] + n > 'Z'){

			printf("%c", kata[i] + n - 26);

		}

		else {

			printf("%c", kata[i] + n);

		}

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

#include <algorithm>



using namespace std;



char N;

int s;



int main()

{

	cin>>s;

	while(cin>>N)

	{

		N+=s;

		if(N>'Z')

		{

			N-=26;

		}

		cout<<N;

	}

}


// Faster C++ solution for the same problem (measured speedup: 5.213796912333989x):
#include<stdio.h>

#include<string.h>



typedef long long ll;



int main(){

	char x[10005];

	int n;

	scanf("%d",&n);

	getchar();

	scanf("%s",x);

	int len = strlen(x);

	for(int i=0;i<len;i++){

		if(x[i]+n>90)

			x[i]-=26;

		printf("%c",x[i]+n);

	}

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

char shift(char ch,int N){

    int d = ch-'A';

    int dn=0;

    if(N+d>25) dn = N+d-26;

    else dn = N+d;

    return (char)(dn+'A');

}

int main (){

    int N;cin >> N;

    string S;cin>>S;

    for(int i=0;i<S.size();i++){

        S[i]=shift(S[i],N);

    }

    cout<<S<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.280996061488056x):
#include<stdio.h>

#include<string.h>



typedef long long ll;



int main(){

	char x[10005];

	int n;

	scanf("%d",&n);

	getchar();

	scanf("%s",x);

	int len = strlen(x);

	for(int i=0;i<len;i++){

		if(x[i]+n>90)

			x[i]-=26;

		printf("%c",x[i]+n);

	}

}
// Slower C++ solution:
#include<iostream>

#include<cstring>

using namespace std;



int main()

{

    int n;

    string s;

    cin >> n >> s;

    for(int i=0;i<s.size();i++)

    {

        s[i]=s[i]+n;

        if(s[i]>90)

            s[i]=s[i]-26;

    }

    cout << s <<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.281683551224422x):
#include<stdio.h>

#include<string.h>



typedef long long ll;



int main(){

	char x[10005];

	int n;

	scanf("%d",&n);

	getchar();

	scanf("%s",x);

	int len = strlen(x);

	for(int i=0;i<len;i++){

		if(x[i]+n>90)

			x[i]-=26;

		printf("%c",x[i]+n);

	}

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main()

{

	int n; string s;

	cin >> n;

	cin >> s;

	if (n > 0)

	{

		for ( int i = 0; i < int( s.size() ); ++i )

		{

			int auxletter = int ( s[i] ) + n;

			if( auxletter >= 91 ) auxletter = 65 + ( auxletter - 91 );  

		

			s[i] = char(auxletter);

		}

	}

	

	

	cout << s;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.259509610214531x):
#include<stdio.h>

#include<string.h>



typedef long long ll;



int main(){

	char x[10005];

	int n;

	scanf("%d",&n);

	getchar();

	scanf("%s",x);

	int len = strlen(x);

	for(int i=0;i<len;i++){

		if(x[i]+n>90)

			x[i]-=26;

		printf("%c",x[i]+n);

	}

}
// Slower C++ solution:
#include <iostream>

#include <string>



using namespace std;

string s;

int n;



int main(){

    ios_base::sync_with_stdio(0);

    cin.tie(NULL);

    cin >> n >> s;

    for(int i = 0; i < s.size(); i++){

        if(s[i]+n > 90) cout << (char)(s[i]+n-26);

        else cout << (char)(s[i]+n);

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.296130957185672x):
#include<stdio.h>

#include<string.h>



typedef long long ll;



int main(){

	char x[10005];

	int n;

	scanf("%d",&n);

	getchar();

	scanf("%s",x);

	int len = strlen(x);

	for(int i=0;i<len;i++){

		if(x[i]+n>90)

			x[i]-=26;

		printf("%c",x[i]+n);

	}

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()

{

    int n;

    cin>>n;

    string s;

    cin>>s;

    for(int i=0;i<s.size();i++)

    {

        int re=s[i];

        re=re+n;



        if(re>90 && (s[i]>='A' && s[i]<='Z'))

        {

            re=re-26;

        }

        char a=re;

        cout<<a;

    }

    return 0;





}


// Faster C++ solution for the same problem (measured speedup: 5.26483410753197x):
#include<stdio.h>

#include<string.h>



typedef long long ll;



int main(){

	char x[10005];

	int n;

	scanf("%d",&n);

	getchar();

	scanf("%s",x);

	int len = strlen(x);

	for(int i=0;i<len;i++){

		if(x[i]+n>90)

			x[i]-=26;

		printf("%c",x[i]+n);

	}

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

#include <algorithm>



using namespace std;



char N;

int s;



int main()

{

	cin>>s;

	while(cin>>N)

	{

		N+=s;

		if(N>'Z')

		{

			N-=26;

		}

		cout<<N;

	}

}


// Faster C++ solution for the same problem (measured speedup: 5.206069864041822x):
#include<stdio.h>



int main(){

	int geser;

	char t[10010];

	scanf("%d", &geser);

	scanf("%s", t);

	for (int i=0 ; t[i] != '\0' ; i++){

		t[i]+= geser;

		if (t[i]>'Z'){

			t[i]-=26;

		}

		printf("%c", t[i]);

	}

	puts("");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

char shift(char ch,int N){

    int d = ch-'A';

    int dn=0;

    if(N+d>25) dn = N+d-26;

    else dn = N+d;

    return (char)(dn+'A');

}

int main (){

    int N;cin >> N;

    string S;cin>>S;

    for(int i=0;i<S.size();i++){

        S[i]=shift(S[i],N);

    }

    cout<<S<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.273169421462755x):
#include<stdio.h>



int main(){

	int geser;

	char t[10010];

	scanf("%d", &geser);

	scanf("%s", t);

	for (int i=0 ; t[i] != '\0' ; i++){

		t[i]+= geser;

		if (t[i]>'Z'){

			t[i]-=26;

		}

		printf("%c", t[i]);

	}

	puts("");

	return 0;

}