Problem:
Score : 300 points

Problem Statement

There are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.

Adjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.

Ultimately, how many slimes will be there?

Constraints

1 \leq N \leq 10^5

|S| = N

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the final number of slimes.

Sample Input 1

10
aabbbbaaca

Sample Output 1

5

Ultimately, these slimes will fuse into abaca.

Sample Input 2

5
aaaaa

Sample Output 2

1

All the slimes will fuse into one.

Sample Input 3

20
xxzaffeeeeddfkkkkllq

Sample Output 3

10

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef  long double ld;
#define inc(i,a,b)  for(long long int i=a;i<=b;i++)
#define dec(i,a,b)  for(long long int i=a;i>=b;i--)
#define fast   ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define pb  push_back
#define all(c)  (c).begin(),(c).end()
#define lv  vector<ll>
#define cv  vector<char>
#define dv  vector<ld>
#define rall(c)  (c).rbegin(),(c).rend()
#define lpr pair<ll,ll>
#define mp make_pair
#define input(c) ll c;cin>>c;
#define lmap map<ll,ll>
#define vinp(a,n) inc(i,1,n){ input(k); a.pb(k); }
#define LIM 1000000007
#define F first
#define S second
#define fr(n) inc(i,0,n-1)
#define fri(n,a) inc(i,0,n-1){ cin>>a[i]; }
void solve()
{
ll i,j;
	ll n;
	cin>>n;
	string s;
	cin>>s;
	ll l=0,r=0;
	ll sum=1;
		while(l<n && r<n)
		{
			if(s[l]==s[r])
				r++;
			else
			{
				l=r;
				sum++;
			}
		}
	cout<<sum;
}
int main()
{
	fast;
	ll t=1;
    //cin>>t;
	while(t--)
    solve();
}