C

Problem description

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
解题思路：题目的意思就是输入的字符串中如果有相同的字符，去掉相同的字符，保留其中一个就好，保证序列中不出现相同的字符，问一共去掉多少个字符。简单处理字符串。

AC代码：

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,i=0,sum=0,num=0;char str[55];
    cin>>n;getchar();//吃掉回车符对字符串的影响
    cin>>str;
    while(str[i]!=''){
        if(str[i+1]==str[i]){
            while(str[i+1]==str[i]){num++;i++;}
        }
        else {sum+=num;num=0;i++;}
    }
    cout<<sum<<endl;
    return 0;
}