CF266A Stones on the Table

There are $ n $ stones on the table in a row, each of them can be red, green or blue. Count the minimum number of stones to take from the table so that any two neighboring stones had different colors. Stones in a row are considered neighboring if there are no other stones between them.

The first line contains integer $ n $ $ (1

Print a single integer — the answer to the problem.