9324: ABC298 —— A - Job Interview
[Creator : ]
Description
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.
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.
Input
The input is given from Standard Input in the following format:
```
$N$
$S$
```
```
$N$
$S$
```
Output
If Takahashi passes, print `Yes`; otherwise, print `No`.
Constraints
$1 \leq N \leq 100$
$S$ is a string of length $N$ consisting of `o`, `-`, and `x`.
$S$ is a string of length $N$ consisting of `o`, `-`, and `x`.
Sample 1 Input
4
oo--
Sample 1 Output
Yes
The first and second interviewers' evaluations are Good, and no interviewer's evaluation is Poor, so he passes.
Sample 2 Input
3
---
Sample 2 Output
No
No interviewer's evaluation is Good, so he fails.
Sample 3 Input
1
o
Sample 3 Output
Yes
100
ooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooox
No
The 100-th interviewer's evaluation is Poor, so he fails.