Problem Statement

You are given a string $S$ that is a permutation of atcoder.
On this string $S$, you will perform the following operation $0$ or more times:

• Choose two adjacent characters of $S$ and swap them.

Find the minimum number of operations required to make $S$ equal atcoder.

Constraints

• $S$ is a string that is a permutation of atcoder

Sample Input 1Copy

catredo

Sample Output 1Copy

8

You can make $S$ equal atcoder in $8$ operations as follows:
catredo $\rightarrow$ [ac]tredo $\rightarrow$ actre[od] $\rightarrow$ actr[oe]d $\rightarrow$ actro[de] $\rightarrow$ act[or]de $\rightarrow$ acto[dr]e $\rightarrow$ a[tc]odre $\rightarrow$ atcod[er]
This is the minimum number of operations achievable.

Sample Input 2Copy

atcoder

Sample Output 2Copy

0

In this case, the string $S$ is already atcoder.

Sample Input 3Copy

redocta

Sample Output 3Copy

21