#include <cassert>

#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#include <boost/foreach.hpp>
//#include <boost/range/algorithm.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
#define INF 1e9
#define LINF 1e18
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define MOD 1000000007LL
#define int long long
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
struct edge{int to,cost;};
typedef pair<int,int> P;

bool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}
bool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}
bool isPrime(int x){if(x==1)return 0;if(x==2)return 1;if(x%2==0)return 0;for(int i=3;i*i<=x;i++)if(x%i==0)return 0;return 1;}
bool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}
bool isnumber(char c){return ('0'<=c&&c<='9');}
bool isalpha(char c){return (isupper(c)&&islower(c));}
void print(vector<int> v){rep(i,0,v.size()){if(i)cout<<" ";cout<<v[i];}cout<<endl;}

signed main (){
    // string s;cin>>s;s+="9";
    // vector<int> v(s.size(),0);
    // rep(i,0,s.size()){
    //     //print(v);
    //     if(v[i]==-1)continue;
    //     if(i<s.size()-1){
    //         if(s[i]!=s[i+1]){
    //             v[i]=v[i+1]=-1;
    //             int diff=1;
    //             while(i-diff>=0&&i+diff+1<s.size()){
    //                 //print(v);
    //                 if(s[i-diff]!=s[i+diff+1]&&v[i-diff]!=-1&&v[i+diff+1]!=-1){
    //                     v[i-diff]=v[diff+i+1]=-1;
    //                     diff++;
    //                     continue;
    //                 }
    //                 break;
    //             }
    //         }
    //     }
    // }
    // int ans=0;
    // rep(i,0,s.size()){
    //     ans+=-v[i];
    // }
    // cout<<ans<<endl;

    string s;cin>>s;
    stack<int> st;
    int n=s.size();
    rep(i,0,n){
        if(st.empty())st.push(s[i]);
        else {
            if(s[i]!=st.top())st.pop();
            else st.push(s[i]);
        }
    }
    cout<<n-st.size()<<endl;
    

    

    
}  
/*
0011
1210

0011001011
1210121210

11011010001011
12123232101012
*/


Measured memory_bytes: 1152