Job Interview

AtCoder
IDabc298_a
Time2000ms
Memory256MB
Difficulty
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 character of $S$ corresponds to the $i$\-th interviewer's evaluation; `o` means Good, `-` means Fair, and `x` means Poor. Takahashi will pass if both of the following conditions are satisfied, and fail otherwise. * At least one interviewer's evaluation is Good. * No interviewer's evaluation is Poor. Determine whether Takahashi passes. ## Constraints * $1 \leq N \leq 100$ * $S$ is a string of length $N$ consisting of `o`, `-`, and `x`. ## Input The input is given from Standard Input in the following format: $N$ $S$ [samples]
Samples
Input #1
4
oo--
Output #1
Yes

The first and second interviewers' evaluations are Good, and no interviewer's evaluation is Poor, so he passes.
Input #2
3
---
Output #2
No

No interviewer's evaluation is Good, so he fails.
Input #3
1
o
Output #3
Yes
Input #4
100
ooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooox
Output #4
No

The $100$\-th interviewer's evaluation is Poor, so he fails.
API Response (JSON)
{
  "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...",
      "is_translate": false,
      "language": "English"
    }
  ]
}
Full JSON Raw Segments