#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
using ll = long long;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;
const int dy[]={0,1,0,-1};
const int dx[]={1,0,-1,0};

int main(){
    int N;
    cin>>N;
    string S;
    cin>>S;
    vector<char> c;
    c.push_back(S[0]);
    for(int i=1;i<N;i++){
        if(S[i]!=c.back()){
            c.push_back(S[i]);
        }
    }
    cout<<c.size()<<endl;
}