#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long
void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }
using ll = long long;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 2e5 + 5;
const int MOD = 1e9+7; //998244353;
const int INF = 0x3f3f3f3f;
const ll INF64 = ll(4e18) + 5;


int dp[MAXN][2][2];

void solve(){
	string s;
	cin >> s;
	int n = s.size();
	for(int i = 1; i <= n; i++){
		for(int j = 0; j < 2; j++){
			for(int k = 0; k < 2; k++){
				dp[i][j][k] = INF;
			}
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < 2; j++){
			for(int k = 0; k < 2; k++){
				for(int w = 0; w < 2; w++){
					if(j == k && k == w) continue;
					if(i == 0 && s[0] == 'b'){
						dp[1][k][w] = min(dp[1][k][w],1ll);
					}
					string pat;
					if(w == 0){
						pat = "aab";
					}else{
						pat = "ab"; 
					}
					int nx = i;
					int sz = pat.size();
					int cnt = 0;
					for(auto c : pat){
						cnt++;
						if(nx < n && s[nx] == c){
							nx++;
						}
						if(nx == n){
							dp[nx][k][w] = min(dp[nx][k][w],dp[i][j][k]+cnt);
						}
					}
					dp[nx][k][w] = min(dp[nx][k][w],dp[i][j][k]+sz);

				}
			}
		}
	}
	int ans = INF;
	for(int i = 0; i < 2; i++){	
		for(int j = 0; j < 2; j++){
			ans = min(ans,dp[n][i][j]);
		}
	}
	cout << ans << '\n';

}

signed main(){

    ios::sync_with_stdio(false); cin.tie(NULL);

    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

/*
Makefile:
CXXFLAGS=-Wall -Wextra -Wshadow -g -pedantic -fsanitize=address,undefined -D_GLIBCXX_DEBUG -D_GLIBCXX_DEBUGPEDANTIC -std=gnu++17
*/