/*
	Created By : Jatin Khattar
*/

#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
#include<set>
using namespace std;

int counter=0;
int main(void)
{
	int value = 0;
	int x;
	cin>>x;
	string s;
	cin>>s;
	char step;
	int n = s.length();
	
	for(int i=0;i<n;i++)
	{
		if(s[i]=='U')
		{
			if(value==0)
				step='M';
				value++;
			
		}
		else
			{
				if(value==0)
					step = 'V';	
				value--;	
			}	
			
		if(value==0 && step=='V')
			counter++;	
	}
	
	cout<<counter;
	
	
//	if( (s[0]=='D' && s[-1]=='U')  ||  (s[0]=='U' && s[n-1]=='D')  ||  (s[0]=='U' && s[n-1]=='U') )
//		cout<<"1";
//	else
//	if( (s[0]=='D' && s[n-1]=='D') )
//		cout<<"2";
//	
}