Migrated from Lutece 1520 string

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

A string consisting of lowercase letters,two adjacent character can be combined if and only if this two character are different.And the combined character is the latter one. (such as "ac" can be combined, and the result is "a").

Now your work is to combined the character as more as possible so that finally the string can be shortest.

Input

A string consisting of lowercase letters. $(1 \leq length \leq 200000)$

Output

a positive integer x means the finally length of string.

Samples

abcd

1

aac

2

Resources

第八届ACM趣味程序设计竞赛第四场（正式赛）