{"problem":{"name":"Triple Metre","description":{"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. *   The extraction of the $i$\\-t","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc230_b"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $S$ is a string consisting of `o` and `x`.\n*   The length of $S$ is between $1$ and $10$ (inclusive).\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc230_b","tags":[],"sample_group":[["xoxxoxxo","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."],["xxoxxoxo","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."],["ox","Yes"]],"created_at":"2026-03-03 11:01:13"}}