#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools as fts
import itertools as its
import math
import sys

INF = float('inf')


def solve(N: int, S: str):
    return len([c for i, c in enumerate(S) if i == 0 or c != S[i-1]])


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    print(f'{solve(N, S)}')


if __name__ == '__main__':
    main() from typing import * import collections collections import functools as fts functools import itertools as its itertools import math math import sys sys INF = float('inf') INF float('inf') float 'inf' def solve(N: int, S: str):
    return len([c for i, c in enumerate(S) if i == 0 or c != S[i-1]]) solve c for i, c in enumerate(S) if i == 0 or c != S[i-1] for i, c in enumerate(S) if i == 0 or c != S[i-1] i c enumerate(S) enumerate S i == 0 or c != S[i-1] i == 0 i 0 c != S[i-1] c S[i-1] S i-1 i 1 if i == 0 or c != S[i-1] c return len([c for i, c in enumerate(S) if i == 0 or c != S[i-1]]) len([c for i, c in enumerate(S) if i == 0 or c != S[i-1]]) len [c for i, c in enumerate(S) if i == 0 or c != S[i-1]] N: int N S: str S def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    print(f'{solve(N, S)}') main sys.setrecursionlimit(10 ** 6) sys.setrecursionlimit sys setrecursionlimit 10 ** 6 10 6 def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
     iterate_tokens for line in sys.stdin:
            for word in line.split():
                yield word
     line sys.stdin sys stdin for word in line.split():
                yield word
     word line.split() line.split line split yield word word tokens = iterate_tokens() tokens iterate_tokens() iterate_tokens N = int(next(tokens)) N int(next(tokens)) int next(tokens) next tokens S = next(tokens) S next(tokens) next tokens print(f'{solve(N, S)}') print f'{solve(N, S)}' if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main def solve(N: int, S: str):
    return len([c for i, c in enumerate(S) if i == 0 or c != S[i-1]]) def solve(N: int, S: str):
    return len([c for i, c in enumerate(S) if i == 0 or c != S[i-1]]) solve INF = float('inf') float('inf') INF def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    print(f'{solve(N, S)}') def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    print(f'{solve(N, S)}') main
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools as fts
import itertools as its
import math
import sys

INF = float('inf')


def solve(N: int, S: str):
    return len([c for i, c in enumerate(S) if i == 0 or c != S[i-1]])


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    print(f'{solve(N, S)}')


if __name__ == '__main__':
    main()
