Fafa and the Gates

两个邻国决定在它们之间建造一堵城墙，并设有一些城门，使公民能够从一个王国走向另一个王国。每当公民通过一座城门时，他都必须支付一枚银币。 世界可以用一个平面的第一象限来表示，而城墙是沿着象限的角平分线（即满足方程 $x=y$ 的射线）。城墙以下的任何一点属于第一个王国，而城墙以上的任何一点都属于第二个王国。角平分线线上的任何整数点都有一个城门（即在点 $(0,0),(1,1),(2,2),\ldots$ 上有城门）。城墙和城门不属于任何一个王国。 法法在位置为 $(0,0)$的城门处，他想在两个王国之间散步。他要按照序列 $S$散步。这个序列是一个字符串，每个字符代表一个动作。法法将做的两个可能的动作是 $\tt'U'$（向上移动一步，即从 $(x,y)$移动到 $(x,y+1)$和 $\tt'R'$（向右移动一步，即从 $(x,y)$移动到 $(x+1,y)$）。 法法想要知道按照序列 $S$散步他需要支付的银币数量。请注意，如果法法在不从一个王国移动到另一个王国的情况下经过城门，他就不付银币。还假定他不在 $(0,0)$处的门口付钱，即，他最初在他需要的一侧。

Two neighboring kingdoms decided to build a wall between them with some gates to enable the citizens to go from one kingdom to another. Each time a citizen passes through a gate, he has to pay one silver coin. The world can be represented by the first quadrant of a plane and the wall is built along the identity line (i.e. the line with the equation $ x=y $ ). Any point below the wall belongs to the first kingdom while any point above the wall belongs to the second kingdom. There is a gate at any integer point on the line (i.e. at points $ (0,0) $ , $ (1,1) $ , $ (2,2) $ , ...). The wall and the gates do not belong to any of the kingdoms. Fafa is at the gate at position $ (0,0) $ and he wants to walk around in the two kingdoms. He knows the sequence $ S $ of moves he will do. This sequence is a string where each character represents a move. The two possible moves Fafa will do are 'U' (move one step up, from $ (x,y) $ to $ (x,y+1) $ ) and 'R' (move one step right, from $ (x,y) $ to $ (x+1,y) $ ). Fafa wants to know the number of silver coins he needs to pay to walk around the two kingdoms following the sequence $ S $ . Note that if Fafa visits a gate without moving from one kingdom to another, he pays no silver coins. Also assume that he doesn't pay at the gate at point $ (0,0) $ , i. e. he is initially on the side he needs.

The first line of the input contains single integer $ n $ $ (1<=n<=10^{5}) $ — the number of moves in the walking sequence. The second line contains a string $ S $ of length $ n $ consisting of the characters 'U' and 'R' describing the required moves. Fafa will follow the sequence $ S $ in order from left to right.

On a single line, print one integer representing the number of silver coins Fafa needs to pay at the gates to follow the sequence $ S $ .

1
U

0

6
RURUUR

1

7
URRRUUU

2

The figure below describes the third sample. The red arrows represent the sequence of moves Fafa will follow. The green gates represent the gates at which Fafa have to pay silver coins.