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 scan = new Scanner(System.in);
        int n = scan.nextInt();
        int valleys = 0;
        int currPos = 0;
        int prevPos = 0;
        scan.nextLine();
        String walk = scan.nextLine();
        for (int i = 0; i < n; i++) {
            char step = walk.charAt(i);
            prevPos = currPos;
            if (step == 'D') currPos--;
            else currPos++;
            
            if (step == 'D' && prevPos == 0) {
                valleys++;
            }
        }
        System.out.println(valleys);
    }
}