{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$.  \nHow many ways are there to choose and underline eight of its characters so that those characters read `c`, `h`, `o`, `k`, `u`, `d`, `a`, `i` from left to right?  \nSince the count can be enormous, print it modulo $(10^9 + 7)$."},{"iden":"constraints","content":"*   $8 \\leq |S| \\leq 10^5$\n*   $S$ consists of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"chchokudai"},{"iden":"sample output 1","content":"3\n\nWe have three valid ways:\nchchokudai  \nchchokudai  \nchchokudai\nwhile the following is invalid:\nchchokudai"},{"iden":"sample input 2","content":"atcoderrr"},{"iden":"sample output 2","content":"0\n\nThe answer may be $0$."},{"iden":"sample input 3","content":"chokudaichokudaichokudai"},{"iden":"sample output 3","content":"45"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}