Stones on the Table

题意翻译

题目描述 桌子上有N个石头,每一块都可以是红的、绿的或蓝的。计算从桌子上取下的石头的最小数量,以便任何两块相邻的石头都有不同的颜色。如果没有其他石头,一排石头被认为是相邻的。 输入输出格式 输入格式: 第一行是一个整数n(1<=n<=50)--桌上石头的数量 第二行是一个字符串s,代表着石头的颜色,石头的排法为从1到n,从左到右。s中的第i个字母如果是"R",那么第i个石头就是红色,"G"是绿色,"B"是蓝色 输出格式: 输出一个整数——这个问题的答案 感谢U91783提供的翻译

题目描述

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<=n<=50) $ — the number of stones on the table. The next line contains string $ s $ , which represents the colors of the stones. We'll consider the stones in the row numbered from $ 1 $ to $ n $ from left to right. Then the $ i $ -th character $ s $ equals "R", if the $ i $ -th stone is red, "G", if it's green and "B", if it's blue.

输出格式


Print a single integer — the answer to the problem.

输入输出样例

输入样例 #1

3
RRG

输出样例 #1

1

输入样例 #2

5
RRRRR

输出样例 #2

4

输入样例 #3

4
BRBG

输出样例 #3

0