{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$ consisting of lowercase English letters and the character `.`.  \nPrint the last substring when $S$ is split by `.`s.  \nIn other words, print the longest suffix of $S$ that does not contain `.`."},{"iden":"constraints","content":"*   $S$ is a string of length between $2$ and $100$, inclusive, consisting of lowercase English letters and `.`.\n*   $S$ contains at least one `.`.\n*   $S$ does not end with `.`."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"atcoder.jp"},{"iden":"sample output 1","content":"jp\n\nThe longest suffix of `atcoder.jp` that does not contain `.` is `jp`."},{"iden":"sample input 2","content":"translate.google.com"},{"iden":"sample output 2","content":"com\n\n$S$ may contain multiple `.`s."},{"iden":"sample input 3","content":".z"},{"iden":"sample output 3","content":"z\n\n$S$ may start with `.`."},{"iden":"sample input 4","content":"..........txt"},{"iden":"sample output 4","content":"txt\n\n$S$ may contain consecutive `.`s."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}