issue #10 Stones on the Table

[dhirajpatil2346]

title - Stones on the Table link - https://codeforces.com/problemset/problem/266/A

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

[dhirajpatil2346]

plz assign this to me

[vaibhv232]

hello sir, assign me this issue