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: a = int(input())
  s = list(input())
  t = [len(s)]
  list = [chr(i) for i in range(65, 65 + 26)]
  for i in s:
      t.append(list.index(i))
  u = [i + a for i in t]
  u = [i - 26 if i >= 26 else i for i in u]
  b = []
  for i in u:
      b.append(list[i])
  k = ""
  for s in b:
      k += s
  print(k)
  
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"}]