import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
inf = float("inf")

n = k()
a = s()
for i in range(n-1):
    if a[i] != a[i+1]:
        count += 1

print(count+1) import sys sys import math math import itertools itertools import bisect bisect from copy import copy from collections import deque,Counter from decimal import Decimal def s(): return input() s def k(): return int(input()) k def S(): return input().split() S def I(): return map(int,input().split()) I def X(): return list(input()) X def L(): return list(input().split()) L def l(): return list(map(int,input().split())) l def lcm(a,b): return a*b//math.gcd(a,b) lcm a a b b sys.setrecursionlimit(10 ** 9) sys.setrecursionlimit sys setrecursionlimit 10 ** 9 10 9 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 count = 0 count 0 ans = 0 ans 0 inf = float("inf") inf float("inf") float "inf" n = k() n k() k a = s() a s() s for i in range(n-1):
    if a[i] != a[i+1]:
        count += 1 i range(n-1) range n-1 n 1 if a[i] != a[i+1]:
        count += 1 a[i] != a[i+1] a[i] a i a[i+1] a i+1 i 1 count += 1 count 1 print(count+1) print count+1 count 1 count = 0 0 count def lcm(a,b): return a*b//math.gcd(a,b) def lcm(a,b): return a*b//math.gcd(a,b) lcm def X(): return list(input()) def X(): return list(input()) X n = k() k() n def I(): return map(int,input().split()) def I(): return map(int,input().split()) I def s(): return input() def s(): return input() s def L(): return list(input().split()) def L(): return list(input().split()) L ans = 0 0 ans a = s() s() a def k(): return int(input()) def k(): return int(input()) k count += 1 1 count def l(): return list(map(int,input().split())) def l(): return list(map(int,input().split())) l def S(): return input().split() def S(): return input().split() S mod = 10**9+7 10**9+7 mod inf = float("inf") float("inf") inf
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
inf = float("inf")

n = k()
a = s()
for i in range(n-1):
    if a[i] != a[i+1]:
        count += 1

print(count+1)
