Page not loading? Try clicking here.
Placeholder

#5318

Photoshoot 2s 256MB

Problems

Farmer John, desperate to win the award for best cow photographer at the county fair, is trying to take the perfect photograph of his N cows (2≤N≤2⋅10^5, N even).

Farmer John owns cows of two potential breeds: Guernseys and Holsteins. To make his photo as aesthetic as possible, he wants to line up his cows so that as many Guernseys are in even-numbered positions in the line as possible (the first position in the line is an odd position, the next is an even position, and so on). Due to his lack of strong communication with his cows, the only way he can achieve his goal is by asking even length "prefixes" of his cows to reverse themselves (a prefix consists of the range of cows from the first cow up to the jth cow for some position j).

Please count the minimum number of reversals required for Farmer John to achieve his goal.


Input

The first line of input contains the value of N.

The second line contains a string of length N, specifying the initial ordering of the cows from left to right. Each 'H' represents a Holstein, while each 'G' represents a Guernsey.


Output

Output the minimum number of reversals needed on a single line.


Example 

14

GGGHGHHGHHHGHG
1

In this example, it suffices to reverse the prefix consisting of the first six cows.

GGGHGHHGHHHGHG (Before)

-> HGHGGGHGHHHGHG (After)

Before the reversal, four Guernseys were at even positions. After the reversal, six Guernseys are at even positions. It is impossible for there to be more than six Guernseys at even positions.


Source

USACO 2022 US Open Bronze

You must sign in to write code.