{"problem":{"name":"Job Interview","description":{"content":"Takahashi had a job interview. You are given the number of interviewers, $N$, and a string $S$ of length $N$ representing the interviewers' evaluations of him.   For each $i=1,2,\\ldots,N$, the $i$\\-th","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc298_a"},"statements":[{"statement_type":"Markdown","content":"Takahashi had a job interview.\nYou are given the number of interviewers, $N$, and a string $S$ of length $N$ representing the interviewers' evaluations of him.  \nFor each $i=1,2,\\ldots,N$, the $i$\\-th character of $S$ corresponds to the $i$\\-th interviewer's evaluation; `o` means Good, `-` means Fair, and `x` means Poor.\nTakahashi will pass if both of the following conditions are satisfied, and fail otherwise.\n\n*   At least one interviewer's evaluation is Good.\n*   No interviewer's evaluation is Poor.\n\nDetermine whether Takahashi passes.\n\n## Constraints\n\n*   $1 \\leq N \\leq 100$\n*   $S$ is a string of length $N$ consisting of `o`, `-`, and `x`.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc298_a","tags":[],"sample_group":[["4\noo--","Yes\n\nThe first and second interviewers' evaluations are Good, and no interviewer's evaluation is Poor, so he passes."],["3\n---","No\n\nNo interviewer's evaluation is Good, so he fails."],["1\no","Yes"],["100\nooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooox","No\n\nThe $100$\\-th interviewer's evaluation is Poor, so he fails."]],"created_at":"2026-03-03 11:01:14"}}