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 steps= in.nextLine();
        int s=0;
        int vally=0;
        int mount =0;
        int down =0;
       //int x=0;
        
        for(int i=0; i<n; i++){
            
             if(steps.charAt(i)=='U'){
                if(s==0){
                    mount++;
                    s =s+1;
                }else{s =s+1;
                     vally--;
                     if(vally==0){
                         down +=1;
                     }}
                   // s =s+1; 
                                
             }else if(steps.charAt(i)=='D'){
                 if(mount!=0){
                     mount--;                    
                    s =s-1;
                }else{s =s-1;
                     vally++;}
                    // s = s-1;
             }
            
             //if(s==0){                 
               // vally = vally+1;
            // }
        }
        
        System.out.println(down);
            }
}