{"raw_statement":[{"iden":"problem statement","content":"How many strings can be obtained by applying the following operation on a string $S$ exactly $K$ times: \"choose one lowercase English letter and insert it somewhere\"?\nThe answer can be enormous, so print it modulo $(10^9+7)$."},{"iden":"constraints","content":"*   $K$ is an integer between $1$ and $10^6$ (inclusive).\n*   $S$ is a string of length between $1$ and $10^6$ (inclusive) consisting of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$K$\n$S$"},{"iden":"sample input 1","content":"5\noof"},{"iden":"sample output 1","content":"575111451\n\nFor example, we can obtain `proofend`, `moonwolf`, and `onionpuf`, while we cannot obtain `oofsix`, `oofelevennn`, `voxafolt`, or `fooooooo`."},{"iden":"sample input 2","content":"37564\nwhydidyoudesertme"},{"iden":"sample output 2","content":"318008117"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}