import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        in.nextLine();
        String travel = in.nextLine();
        char[] steps = travel.toCharArray();
        int level = 0;
        int valleys = 0;
        for(int i = 0; i < n; i++) {
            if(steps[i] == 'U') {
                if(level == -1) {
                    //Valley end
                    valleys++;
                }
                level++;
            }
            if(steps[i] == 'D') {
                level--;
            }
        }
        System.out.println(valleys);
    }
}