output_description: Print the string resulting from shifting each character of S by N in
  alphabetical order.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      S
attempt: N = int(input())
  S = input()
  list_S = list(S)
  list_ans = []
  
  alphabet_number = {
      "a": 1,
      "b": 2,
      "c": 3,
      "d": 4,
      "e": 5,
      "f": 6,
      "g": 7,
      "h": 8,
      "i": 9,
      "j": 10,
      "k": 11,
      "l": 12,
      "m": 13,
      "n": 14,
      "o": 15,
      "p": 16,
      "q": 17,
      "r": 18,
      "s": 19,
      "t": 20,
      "u": 21,
      "v": 22,
      "w": 23,
      "x": 24,
      "y": 25,
      "z": 26,
  }
  
  number_alphabet = {
      1: "a",
      2: "b",
      3: "c",
      4: "d",
      5: "e",
      6: "f",
      7: "g",
      8: "h",
      9: "i",
      10: "j",
      11: "k",
      12: "l",
      13: "m",
      14: "n",
      15: "o",
      16: "p",
      17: "q",
      18: "r",
      19: "s",
      20: "t",
      21: "u",
      22: "v",
      23: "w",
      24: "x",
      25: "y",
      26: "z",
  }
  
  for i in range(len(list_S)):
      A = alphabet_number[list_S[i]]
      if A + N <= 26:
          B = A + N
      else:
          B = (A + N) - 26
  
      C = number_alphabet[B]
      list_ans.append(C)
  
  print("".join(list_ans))
  
problem_description: 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`).
samples: [{"input": "2\n    ABCXYZ", "output": "CDEZAB\n    \n\nNote that `A` follows `Z`.\n\n* * *"}, {"input": "0\n    ABCXYZ", "output": "ABCXYZ\n    \n\n* * *"}, {"input": "13\n    ABCDEFGHIJKLMNOPQRSTUVWXYZ", "output": "NOPQRSTUVWXYZABCDEFGHIJKLM"}]