Codeforces 719B B. Anatoly and Cockroaches

B. Anatoly and Cockroaches

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output

Anatoly lives in the university dorm as many other students do. As you know, cockroaches are also living there together with students. Cockroaches might be of two colors: black and red. There are n cockroaches living in Anatoly’s room.

Anatoly just made all his cockroaches to form a single line. As he is a perfectionist, he would like the colors of cockroaches in the line to alternate. He has a can of black paint and a can of red paint. In one turn he can either swap any two cockroaches, or take any single cockroach and change it’s color.

Help Anatoly find out the minimum number of turns he needs to make the colors of cockroaches in the line alternate.

Input
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of cockroaches.

The second line contains a string of length n, consisting of characters ‘b’ and ‘r’ that denote black cockroach and red cockroach respectively.

Output
Print one integer — the minimum number of moves Anatoly has to perform in order to make the colors of cockroaches in the line to alternate.

Examples
input

5
rbbrr

output

1

input

5
bbbbb

output

2

input

3
rbr

output

0

Note
In the first sample, Anatoly has to swap third and fourth cockroaches. He needs 1 turn to do this.

In the second sample, the optimum answer is to paint the second and the fourth cockroaches red. This requires 2 turns.

In the third sample, the colors of cockroaches in the line are alternating already, thus the answer is 0.

n = int(raw_input())
s = raw_input()
a = []
for i in range(n):
    a.append(s[i])
shift = dict()
shift['r'] = 'b'
shift['b'] = 'r'
# rbrbrbr
rb_0,rb_1 = 0,0
for i in range(0,n,2):
    if 'b' == a[i]:
        rb_0 += 1
for i in range(1,n,2):
    if 'r' == a[i]:
        rb_1 += 1
rb_cnt = min(rb_0,rb_1)
rb_0 -= rb_cnt
rb_1 -= rb_cnt
rb_cnt += rb_0
rb_cnt += rb_1

# brbrbrbr
br_0,br_1 = 0,0
for i in range(0,n,2):
    if 'r' == a[i]:
        br_0 += 1
for i in range(1,n,2):
    if 'b' == a[i]:
        br_1 += 1
br_cnt = min(br_0, br_1)
br_0 -= br_cnt
br_1 -= br_cnt
br_cnt += br_0
br_cnt += br_1

print min(br_cnt,rb_cnt)