Problem:
Score : 200 points

Problem Statement

We have a string S consisting of uppercase English letters. Additionally, an integer N will be given.

Shift each character of S by N in alphabetical order (see below), and print the resulting string.

We assume that A follows Z. For example, shifting A by 2 results in C (A \to B \to C), and shifting Y by 3 results in B (Y \to Z \to A \to B).

Constraints

0 \leq N \leq 26

1 \leq |S| \leq 10^4

S consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the string resulting from shifting each character of S by N in alphabetical order.

Sample Input 1

2
ABCXYZ

Sample Output 1

CDEZAB

Note that A follows Z.

Sample Input 2

0
ABCXYZ

Sample Output 2

ABCXYZ

Sample Input 3

13
ABCDEFGHIJKLMNOPQRSTUVWXYZ

Sample Output 3

NOPQRSTUVWXYZABCDEFGHIJKLM

Solution in C (GCC 5.4.1) (judge verdict: Runtime Error)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int ordem( const void *a, const void *b){
    int x=*(int *)a;
    int y= *(int *)b;

    if (x>y){
        return 1;
    } else if (x<y){
        return -1;
    } else {
        return 0;
    }
}
int main()
{
    int n,s[11234];
    scanf("%d %s", &n, s);

    for(int i=0; i<= strlen(s);i++){
        if(90 - (s[i]+n)>0){
            s[i] = ( 65 + (90-(s[i] + n) ));
        }
         if((90 - (s[i]+n))<=0){
            s[i]= s[i]+n;
            }
    }
    qsort(s, strlen(s), sizeof(char),ordem);
    for(int j=0; j<= strlen(s);j++){
        printf("%s", s[j]);
      }

    return 0;
}