#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main(){

    int n,i,pos=0,level=0,valley=0;
    cin>>n;
    char steps[n];
    for(i=0;i<n;i++)
        cin>>steps[i];
    for(i=0;i<n;i++){
        if(steps[i]=='U'){
            pos++;
        if(pos==level)
            valley++; 
        }
        if(steps[i]=='D')
            pos--;
    }
    cout<<valley;
    
    return 0;
}