{"raw_statement":[{"iden":"statement","content":"You are given an encrypted string, encrypted using a certain algorithm.Decrypt it !\n\nThe first and single line of input contains a string s, which each of it's characters is a lower case English letter. (1 ≤ |s| ≤ 105)\n\nPrint the original string.\n\n"},{"iden":"input","content":"The first and single line of input contains a string s, which each of it's characters is a lower case English letter. (1 ≤ |s| ≤ 105)"},{"iden":"output","content":"Print the original string."},{"iden":"examples","content":"InputpunemruOutputcharzehInputlbhfrsvOutputyousefiInputzzgOutputmmt"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ s \\in \\Sigma^* $ be the encrypted string, where $ \\Sigma = \\{a, b, \\dots, z\\} $ and $ 1 \\leq |s| \\leq 10^5 $.\n\n**Constraints**  \nAll characters in $ s $ are lowercase English letters.\n\n**Objective**  \nDecrypt $ s $ to recover the original string $ s' $, where the decryption algorithm is implicitly defined but not specified.","simple_statement":"Decrypt the string by shifting each letter back by 1 in the alphabet (a becomes z, b becomes a, c becomes b, etc.).","has_page_source":false}