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


int main() {
    long long int n,i,count;
    signed int pos;
    char step[1000000];
    cin>>n;
    for(i=0,pos=0,count=0;i<n;i++)
    {
        cin>>step[i];
        if(step[i]=='U')
            pos+=1;
        else
            pos-=1;
        if(pos==0)
            if(step[i]=='U')
                count++;
    }
    cout<<count;
    return 0;
}