#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 <climits>
#include <cstring>
#include <cassert>


using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> p) {
    os << p.first << ":" << p.second;
    return os;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
    os << "[";
    for (auto it = mp.begin(); it != mp.end(); ++it) {
        if (it != mp.begin()) {
            os << ", ";
        }
        os << *it;
    }
    return os << "]";
}

// edit

// dp state : [left foot][right foot][idx], value is invalid count.
int dp[9][9][2][100000];
string S;

// lr : last foot is left -> 0, last foot is right -> 1
int dfs(int l, int r, int lr, int idx) {
    if (idx == S.size()) {
        return 0;
    }
    int &ret = dp[l][r][lr][idx];
    if (ret != -1) return ret;

    ret = INF;
    int x = S[idx] - '1';

    // 右足を目的地へ
    if (l % 3 <= x % 3) {
        // targetが左足よりは右側にないとだめ
        int tmp = dfs(l, x, 1, idx + 1) + lr;
        chmin(ret, tmp);
    }

    // 左足を目的地へ
    if (x % 3 <= r % 3) {
        int tmp = dfs(x, r, 0, idx + 1) + !lr;
        chmin(ret, tmp);
    }

//    if (l != 5 && r != 5) {
//        // 右足を5へ
//        if (l % 3 <= 5 % 3) {
//            int tmp = dfs(l, 5, 1, idx) + lr;
//            chmin(ret, tmp);
//        }
//
//        // 左足を5へ
//        if (5 % 3 <= r % 3) {
//            int tmp = dfs(5, r, 0, idx) + !lr;
//            chmin(ret, tmp);
//        }
//    }

    return ret;
}

bool solve() {
    memset(dp, -1, sizeof(dp));
    cin >> S;

    if (S == "#") return false;

    if (S.size() <= 2) {
        cout << 0 << endl;
        return true;
    }

    int ans = INF;
    int a = S[0] - '1';
    int b = S[1] - '1';
    int tmp;

    if (a % 3 <= b % 3) {
        tmp = dfs(a, b, 1, 2);
        chmin(ans, tmp);
    }
    if (a % 3 >= b % 3) {
        tmp = dfs(b, a, 0, 2);
        chmin(ans, tmp);
    }

    cout << ans << endl;

    return true;
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    while (solve());


    return 0;
}



Measured memory_bytes: 74244