第一期第三题

Stones on the Table

Time limit 2000 ms
Memory limit 262144 kB
Source Codeforces Round #163 (Div. 2)
Tag simplementation *800
Editorial Announcement Tutorial

Problem Descripton

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.

Input

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.

Output

Print a single integer — the answer to the problem.

Examples Input

3
RRG

Output

1

Input

5
RRRRR

Output

4

Input

4
BRBG

Output

0

问题链接：https://vjudge.net/problem/36572/origin
问题简述：桌上排列着数个不同颜色的球，抽出最少数量的球，使得每两个相邻的球之间颜色都不同，求出需要抽出的次数
程序说明：若相邻的元素相等，t=+t

AC通过的c++语言程序如下:

#include<iostream>
using namespace std;
int main()
{
	char a[100];
	int n, t = 0;
	cin>>n;	
	cin >> (a);
	for (int i = 0; i < n-1; i++)
	{
		if (a[i] == a[i + 1])
			t++;
	}
		cout << t << endl;
}