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


int main() {
    long int n;
    char temp;
    cin>>n;
    vector<long int> a(n+1,0);
    for(long int i=1;i<=n;i++)
       { 
        cin>>temp;
        if(temp=='U')
            a[i]=a[i-1]+1;
        else
            a[i]=a[i-1]-1;
       }
    long int count=0;
    int mark;
    for(long int i=0;i<n;i++)
        {
        if(a[i]==0 && a[i+1]<0)
            {i++;
            while(a[i+1]!=0 && i<n)
                {
                i++;
            }
             if(i!=n)
             count++;
        }  
    }
    cout<<count;
    return 0;
}