n=int(input())
s=list(input())
ans=0
i=0
while i+1<n:
  j=0
  while s[i+j]==s[i+j+1]:
    if i+j+1<=n-2:
      j+=1
    else:
      j+=1
      break
  i+=j+1
  ans+=j
  
print(n-ans) n=int(input()) n int(input()) int input() input s=list(input()) s list(input()) list input() input ans=0 ans 0 i=0 i 0 while i+1<n:
  j=0
  while s[i+j]==s[i+j+1]:
    if i+j+1<=n-2:
      j+=1
    else:
      j+=1
      break
  i+=j+1
  ans+=j
   i+1<n i+1 i 1 n j=0 j 0 while s[i+j]==s[i+j+1]:
    if i+j+1<=n-2:
      j+=1
    else:
      j+=1
      break
   s[i+j]==s[i+j+1] s[i+j] s i+j i j s[i+j+1] s i+j+1 i+j i j 1 if i+j+1<=n-2:
      j+=1
    else:
      j+=1
      break
   i+j+1<=n-2 i+j+1 i+j i j 1 n-2 n 2 j+=1 j 1 j+=1 j 1 break i+=j+1 i j+1 j 1 ans+=j ans j print(n-ans) print n-ans n ans j+=1 1 j ans+=j j ans i=0 0 i j+=1 1 j ans=0 0 ans i+=j+1 j+1 i n=int(input()) int(input()) n s=list(input()) list(input()) s j=0 0 j
n=int(input())
s=list(input())
ans=0
i=0
while i+1<n:
  j=0
  while s[i+j]==s[i+j+1]:
    if i+j+1<=n-2:
      j+=1
    else:
      j+=1
      break
  i+=j+1
  ans+=j
  
print(n-ans)