#include <bits/stdc++.h>

using namespace std;

const int L = 30, N = 1.5e5 + 5;

int c[L], f[L][N];
vector<int> p;

int calc() {
    int x = 0, s = 0;
    for (int i = (int)p.size() - 1; ~i; --i) {
        int t = p[i];
        if (f[t][x] < 0) {
        	if (s + c[t] + f[t][x] + 1 == 7) {
        		puts("!");
			}
			return s + c[t] + f[t][x] + 1;
		}
        x = f[t][x], s += c[t];
    }
    return 1e9;
}

int dfs(int x) {
    int v;
    if (x < 2) {
        p.push_back(x), v = calc();
    } else {
        v = dfs(x - 2), p.push_back(x - 2), v = min(v, dfs(x - 1));
    }
    p.pop_back(); return v;
}

signed main() {
    string S; cin >> S; int n = S.size();
    for (int i = 0; i < L; ++i) {
        c[i] = (i < 2 ? 1 : c[i - 1] + c[i - 2]);
        f[i][n] = -c[i] - 1;
    }
    iota(f[0], f[0] + n, 0), iota(f[1], f[1] + n, 0);
    for (int i = n - 1; ~i; --i) {
        f[S[i] == 'a'][i] = (i + 1 == n ? -1 : i + 1);
    }
    for (int i = 2; i < L; ++i) for (int j = 0; j < n; ++j) {
        f[i][j] = f[i - 1][j] < 0 ? f[i - 1][j] - c[i - 2] : f[i - 2][f[i - 1][j]];
    }
    printf("%d\n", dfs(L - 1));
    return 0;
}