Triangular Swaps

You are given a string S of length N consisting of lowercase english alphabets.

In one operation, you can:

• Choose any three consecutive characters in S;
• Apply a circular left shift operation on the chosen characters.

For example, let the string be codechef. In one operation, you can:

• Choose characters S2S3S4
• Apply a circular left shift to convert S2S3S4 to S3S4​S2
• ​ Thus, the string becomes cdeochef.

Your task is to find out the number of distinct strings that are possible if you apply the above mentioned operation exactly once.