Swapping Chefs Way

Chef is working on his swap-based sorting algorithm for strings. Given a string $S$ of length $N$, he wants to know whether he can sort the string using his algorithm. According to the algorithm, one can perform the following operation on string $S$ any number of times: - Choose some index $i$ $(1 \leq i \leq N)$ and swap the $i^{th}$ character from the front and the $i^{th}$ character from the