Carol wants to go to California!

Tudor recently gave Carol a game with similarities to Boggle. There is an grid of letters,
all of which are either `C`

, `A`

, `L`

, or `I`

. In a single turn, Carol must select a `C`

, an `A`

, an `L`

,
and an `I`

such that the `C`

and `A`

touch in at least one corner, as do the `A`

and `L`

as well as the `L`

and `I`

. Carol gains one point for doing so, but cannot select any of those letters in future turns.

Compute the maximum number of points Carol can earn.

#### Constraints

In tests worth marks, you may assume .

In tests worth an additional marks, you may assume .

#### Input Specification

The first line of the input contains a single integer, .

The next lines contain characters, all of which appear in `CALI`

.

#### Output Specification

Output, on a single line, the maximum number of points Carol can earn if she plays optimally.

#### Sample Input

```
4
CALI
ILAC
CLLC
IAAI
```

#### Sample Output

`4`

## Comments