{"raw_statement":[{"iden":"problem statement","content":"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$.\nAdjacent 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.\nUltimately, how many slimes will be there?"},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^5$\n*   $|S| = N$\n*   $S$ consists of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$S$"},{"iden":"sample input 1","content":"10\naabbbbaaca"},{"iden":"sample output 1","content":"5\n\nUltimately, these slimes will fuse into `abaca`."},{"iden":"sample input 2","content":"5\naaaaa"},{"iden":"sample output 2","content":"1\n\nAll the slimes will fuse into one."},{"iden":"sample input 3","content":"20\nxxzaffeeeeddfkkkkllq"},{"iden":"sample output 3","content":"10"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}