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();
        char steps[] = new char[n];
        String s = in.next();
        for(int steps_i=0; steps_i < n; steps_i++){
            steps[steps_i] = s.charAt(steps_i);
        }
        int pos = 0; int count = 0; boolean b = false;
        if (steps[0] == 'U') b = true;
        for (int i = 0; i < n; i++) {
            if (steps[i] == 'U') pos++;
            if (steps[i] == 'D') pos--;
            if (pos == 0) {
                if (!b) count++;
                if (i < n - 1) 
                    if (steps[i + 1] == 'U') b = true;
                    else b = false;
            }
        }
        System.out.println(count);
    }
}