#include <bits/stdc++.h>

using namespace std;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  string s; cin >> s;
  int n = s.size();
  string pat = "ba";
  vector<int> fib{1, 1};
  vector<vector<int>> jmp;
  for (int j: {0, 1}) {
    jmp.push_back(vector(n, 0));
    for (int i = 0; i < n; ++i) jmp[j][i] = i + (s[i] == 'b' - j);
  }
  for (int more = 1; jmp.back()[0] < n || more--; ) {
    fib.push_back(fib.end()[-2] + fib.end()[-1]);
    int j = jmp.size() - 1;
    jmp.push_back(vector(n, 0));
    for (int i = 0; i < n; ++i) jmp[j + 1][i] = jmp[j][i] == n? n: jmp[j - 1][jmp[j][i]];
  }
  int ans = 1e9;
  vector<int> v{fib.size() - 1};
  do {
    if (v.back() > 1) {
      v.push_back(v.back() - 1);
      v.end()[-2] -= 2;
      continue;
    } else if (pat[v.back()] != s[0]) {
      v.pop_back();
      continue;
    }
    int l = 0, i = v.size() - 1, j = 0;
    while (~i && jmp[v[i]][j] < n) l += fib[v[i]], j = jmp[v[i--]][j];
    if (!~i) break;
    int c = v[i];
    while (c > 1) jmp[c - 1][j] < n? j = jmp[c - 1][j], l += fib[c - 1], c -= 2: --c;
    ans = min(ans, l + 1);
    v.pop_back();
  } while (v.size());
  cout << ans;
}