{"raw_statement":[{"iden":"statement","content":"You are given an encrypted string, encrypted using a certain algorithm.Decrypt it !\n\nEach character of the encrypted string has ASCII code between 0 and 255 inclusive.So you're given the ASCII code of each character.It's guaranteed that the original string is made of lower case English letters.\n\nThe first line of input contains integer n, the size of the encrypted string. (1 ≤ n ≤ 105).\n\nThe second line contains n integers between 0 and 255 inclusive, speared by space.\n\nPrint the original string.\n\n"},{"iden":"input","content":"The first line of input contains integer n, the size of the encrypted string. (1 ≤ n ≤ 105).The second line contains n integers between 0 and 255 inclusive, speared by space."},{"iden":"output","content":"Print the original string."},{"iden":"examples","content":"Input78 25 0 3 7 16 25OutputcharzehInput76 28 18 10 16 17 4OutputyousefiInput320 20 11Outputmmt"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ n \\in \\mathbb{Z} $ be the length of the encrypted string.  \nLet $ C = (c_1, c_2, \\dots, c_n) $ be a sequence of integers where $ c_i \\in [0, 255] $ for all $ i \\in \\{1, \\dots, n\\} $, representing the ASCII codes of the encrypted characters.  \n\n**Constraints**  \n1. $ 1 \\leq n \\leq 10^5 $  \n2. $ 0 \\leq c_i \\leq 255 $ for all $ i \\in \\{1, \\dots, n\\} $  \n3. The original string consists solely of lowercase English letters (ASCII codes 97 to 122).  \n\n**Objective**  \nRecover the original string $ S = (s_1, s_2, \\dots, s_n) $, where each $ s_i $ is the character corresponding to ASCII code $ c_i $, i.e.,  \n$$ s_i = \\text{chr}(c_i) $$  \nand output the string $ S $.","simple_statement":"You are given a string encrypted by adding 21 to each character's ASCII code. Decrypt it by subtracting 21 from each number and convert to characters. The original string contains only lowercase English letters.","has_page_source":false}