Matcom Online Grader

ℹ️ We've recently migrated MOG to a new server with a different grader. As a result, some features—especially those related to submission evaluation—might not work correctly. If you encounter any issues, please report them by clicking the exclamation icon in the bottom right corner of the website.

Matcom Grader Speed Contest - 2019

Ended

Overview
Problems
Standing
Submissions
Submit
Clarifications
Virtual participation

Register

Are you sure you want to participate in this contest ? If you select a team then virtual participation for other team members will be disabled. So, pick one if and only if your teammates are ready to compete with you.

J - Joining cubes

Languages: C, C++, Java, Python, Kotlin, C#

Time & Memory limits: (details)

There are

N $N$ cubes stacked vertically on a desk. You are given a string

S $S$ of length

N $N$ . The color of the

i $i$ -th cube from the bottom is red if the

i $i$ -th character in

S $S$ is

0 $0$ , and blue if that character is

1 $1$ .

You can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.

What is the maximum number of cubes that can be removed?

Input

The input contains one line with the string $S$ and with $|S|=N$ and $1 \leq N \leq 10^5$ . Each character in $S$ is $0$ or $1$ .

Output

Print the maximum number of cubes that can be removed.

Sample test(s)

Input

0011

Output

Input

11011010001011

Output

Input

Output