| Statement | You are given a string S consisting of some number of 'o', '+', '-', '='. Replace it with "yes" if the equality holds, "no" otherwise. Constraint * S contains exactly one '='. * There is no '+' or '-' to the right of '='. * |S| ≤ 20 |
|---|---|
| Sample Input | |
| Sample Output |