#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

vector<pll> generate(int n, int seed, vi Dprefix, int maxD, vi Tprefix, int factor) {
  vl random(2*n);
  random[0] = seed;
  for (int i = 1; i <= 2*n-1; i++) {
    random[i] = (random[i-1] * 1103515245 + 12345) % (1LL << 31);
  }

  vl D(n), T(n);
  for (int i = 0; i <= Dprefix.size() - 1; i++) {
    D[i] = Dprefix[i];
    T[i] = Tprefix[i];
  }

  for (int i = Dprefix.size(); i <= n - 1; i++) {
    D[i] = 1 + (random[2*i] % maxD);
    ll maxT = max(1LL, D[i] / factor);
    T[i] = 1 + (random[2*i+1] % maxT);
  }

  //DEBUG_VEC(D);
  //DEBUG_VEC(T);

  vector<pll> dt(n);
  rep (i, n) {
    dt[i] = pll(D[i], T[i]);
  }
  return dt;
}

class SchedulingWoes{
public:
  int study(int n, int seed, vi Dprefix, int maxD, vi Tprefix, int factor) {
    vector<pll> dt = generate(n, seed, Dprefix, maxD, Tprefix, factor);
    dt.push_back(pll(0, INF));
    sort(all(dt));
    //DEBUG_VEC(dt);

    priority_queue<ll, vector<ll>, greater<ll>> td;
    int ans = 0;
    rrep (i, n + 1) {
      if (i == 0) break;
      ll time = dt[i].first - dt[i - 1].first;
      td.push(dt[i].second);
      //DEBUG(time);
      while (time > 0 and td.size() > 0) {
        ll t = td.top();
        td.pop();
        if (time >= t) {
          time -= t;
          ans++;
        }
        else {
          t -= time;
          td.push(t);
          time = 0;
        }
      }
      //DEBUG(ans);
    }
    return ans;
  }
  
};

int main() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  int ans = 0;
  rep (i, n - 1) {
    if (s[i] != s[i + 1]) ans++;
  }
  cout << ans + 1 << endl;
}


Measured memory_bytes: 512