{"problem":{"name":"Slimes","description":{"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 t","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc143_c"},"statements":[{"statement_type":"Markdown","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?\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^5$\n*   $|S| = N$\n*   $S$ consists of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc143_c","tags":[],"sample_group":[["10\naabbbbaaca","5\n\nUltimately, these slimes will fuse into `abaca`."],["5\naaaaa","1\n\nAll the slimes will fuse into one."],["20\nxxzaffeeeeddfkkkkllq","10"]],"created_at":"2026-03-03 11:01:14"}}