| Statement | You are given nonempty S containing only 't', 'e', 's'. If you can rearrange S so that it becomes N 't's and N-1 "es"s alternated, replace S with it. Otherwise, replace S with "no". Constraint * The number of each character does not exceed 5. |
|---|---|
| Sample Input | |
| Sample Output |