{"problem":{"name":"Q. Peace of bzjd","description":{"content":"You are given an encrypted string, encrypted using a certain algorithm. Decrypt it ! The first and single line of input contains a string s, which each of it's characters is a lower case English lett","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10051Q"},"statements":[{"statement_type":"Markdown","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## Input\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\n## Output\n\nPrint the original string.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**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**  \n1. Each character of $ s $ is a lowercase English letter.\n\n**Objective**  \nRecover the original string $ s_{\\text{orig}} $ by applying the inverse of the encryption algorithm.  \n\n*(Note: Encryption algorithm unspecified — formal statement cannot be completed without its definition.)*","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10051Q","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}