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`.

Input is given from Standard Input in the following format:

```
$S$
```

Print the answer as an integer.

-   $S$ is a string that is a permutation of `atcoder`

8

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