{"raw_statement":[{"iden":"problem statement","content":"A string $S$ is said to be a substring of a string $T$ when there is a pair of integers $i$ and $j$ ($1 \\leq i \\leq j \\leq |T|)$ that satisfy the following condition.\n\n*   The extraction of the $i$\\-th through $j$\\-th characters of $T$ without changing the order equals $S$.\n\nLet $T$ be the concatenation of $10^5$ copies of `oxx`.  \nGiven a string $S$, print `Yes` if $S$ is a substring of $T$, and `No` otherwise."},{"iden":"constraints","content":"*   $S$ is a string consisting of `o` and `x`.\n*   The length of $S$ is between $1$ and $10$ (inclusive)."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"xoxxoxxo"},{"iden":"sample output 1","content":"Yes\n\n$T$ begins like this: `oxxoxxoxxoxx`... Since the extraction of $3$\\-rd through $10$\\-th characters of $T$ equals $S$, $S$ is a substring of $T$, so `Yes` should be printed."},{"iden":"sample input 2","content":"xxoxxoxo"},{"iden":"sample output 2","content":"No\n\nSince there is no way to extract from $T$ a string that equals $S$, $S$ is not a substring of $T$, so `No` should be printed."},{"iden":"sample input 3","content":"ox"},{"iden":"sample output 3","content":"Yes"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}