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.

    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

问题分析：桌面上相邻的石头颜色要不一样，如果一样就抽掉一颗，使相邻的石头颜色不一样，抽掉的颗数加一，最后输出抽掉的石头颗数

问题思路：判断相邻的两颗石头的颜色是否相同。相同，颗数加一；不同，继续循环。直到遇见’\0’，结束循环，输出结果

程序分析：本程序用while（）语句进行循环

#include<iostream>
using namespace std;
int main()
{
 char a[51];
 int n, i = 0, length = 0;
 cin >> n;
 cin>> a;
 while (a[i] !='\0')
 {
  if (a[i] == a[i + 1])
  {
   length++; 
  }
  i++;
 }
 cout << length << endl;
 return 0;
}