Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Santa Claus and Robot

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputSanta Claus has Robot which lives on the infinite grid and can move along its lines. He can also, having a sequence of *m* points *p*_{1}, *p*_{2}, ..., *p*_{m} with integer coordinates, do the following: denote its initial location by *p*_{0}. First, the robot will move from *p*_{0} to *p*_{1} along one of the shortest paths between them (please notice that since the robot moves only along the grid lines, there can be several shortest paths). Then, after it reaches *p*_{1}, it'll move to *p*_{2}, again, choosing one of the shortest ways, then to *p*_{3}, and so on, until he has visited all points in the given order. Some of the points in the sequence may coincide, in that case Robot will visit that point several times according to the sequence order.

While Santa was away, someone gave a sequence of points to Robot. This sequence is now lost, but Robot saved the protocol of its unit movements. Please, find the minimum possible length of the sequence.

Input

The first line of input contains the only positive integer *n* (1 ≤ *n* ≤ 2·10^{5}) which equals the number of unit segments the robot traveled. The second line contains the movements protocol, which consists of *n* letters, each being equal either L, or R, or U, or D. *k*-th letter stands for the direction which Robot traveled the *k*-th unit segment in: L means that it moved to the left, R — to the right, U — to the top and D — to the bottom. Have a look at the illustrations for better explanation.

Output

The only line of input should contain the minimum possible length of the sequence.

Examples

Input

4

RURD

Output

2

Input

6

RRULDD

Output

2

Input

26

RRRULURURUULULLLDLDDRDRDLD

Output

7

Input

3

RLL

Output

2

Input

4

LRLR

Output

4

Note

The illustrations to the first three tests are given below.

The last example illustrates that each point in the sequence should be counted as many times as it is presented in the sequence.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/18/2019 18:12:55 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|