#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n;
    cin>>n;
    string s;
    cin>>s;
    int stepp[n+2]={0};
    int step=0,valley=0,count=0;
    for(int i=0;i<n;i++)
        {
        if(s[i]=='U')
            step++;
        if(s[i]=='D')
            step--;
        if(step>0)
            stepp[i+1]=1;
        if(step<0)
            stepp[i+1]=-1;
        if(step==0)
            stepp[i+1]==0;
    }
    for(int i=0;i<n+1;i++)
        if(stepp[i]==0 && stepp[i+1]==-1)
            count++;
    cout<<count<<endl;
    return 0;
}