### Problem Statement

We are loading a container ship with a single crane. The containers are on the dock, adjacent to each other in a line. Each container is owned by one of our 4 customers. We need to rearrange them so that the containers are still in a line with no gaps located somewhere on the dock, with each customer's containers adjacent to each other.

We move a container by using our crane to pick up a single container and place it somewhere on the dock (but not on top of another container). The problem is to minimize the number of moves.

The String containers shows the original order of the containers, with each container appearing as 'A','B','C', or 'D' according to which of our customers is the owner. Return the minimum number of moves required.

### Definition

 Class: CraneSort Method: moves Parameters: String Returns: int Method signature: int moves(String containers) (be sure your method is public)

### Constraints

-containers will contain between 1 and 50 characters, inclusive.
-containers will contain only the characters 'A','B','C', or 'D'.

### Examples

0)

 `"CBBADDD"`
`Returns: 0`
 The containers are already arranged so that each customer's containers are adjacent.
1)

 `"ABCAA"`
`Returns: 1`
 We can move the leftmost container to the right end of the line.
2)

 `"CCCCBAAABA"`
`Returns: 3`
 We can move the first B to a temporary location somewhere on the dock. Then move the rightmost A to the spot where that B used to be. Finally move the B from its temporary location to the right end of the line, resulting in CCCCAAAABB. (There are other ways to do it in 3 moves.)

#### Problem url:

http://www.topcoder.com/stat?c=problem_statement&pm=8775

#### Problem stats url:

http://www.topcoder.com/tc?module=ProblemDetail&rd=12019&pm=8775

dgoodman

#### Testers:

PabloGilberto , Olexiy , misof , ivan_metelsky

Brute Force