#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>


using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; }
#endif
#ifdef __GNUC__
template <class T> int popcount(T n);
template <> int popcount(unsigned int n) { return n ? __builtin_popcount(n) : 0; }
template <> int popcount(int n) { return n ? __builtin_popcount(n) : 0; }
template <> int popcount(unsigned long long n) { return n ? __builtin_popcountll(n) : 0; }
template <> int popcount(long long n) { return n ? __builtin_popcountll(n) : 0; }
#endif

#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))

#define rep(i, n) for (int i = 0; i < n; ++i)

template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }

typedef long long ll;
typedef pair<int, int> pint;

const double EPS = 1e-8;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
bool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }

template <class T> void print(T a, int n, int br = 1, const string& deli = ", ") { cout << "{ "; for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } cout << " }"; while (br--) cout << endl; }
template <class T> void print(const vector<T>& v, int br = 1, const string& deli = ", ") { print(v, v.size(), br, deli); }



struct P
{
	int p, l, r, t, c;
	P(int p, int l, int r, int t, int c)
		: p(p), l(l), r(r), t(t), c(c) { }
	bool operator<(const P& a) const { return c > a.c; }
};
int main()
{
	ios::sync_with_stdio(false);

	string s;
	while (cin >> s, s[0] != '#')
	{
		int n = s.size();
		const int INF = 1 << 29;
		static int dp[114514][3][3][2];
		for (int i = 0; i <= n; ++i)
			for (int j = 0; j < 3; ++j)
				for (int k = 0; k < 3; ++k)
					for (int l = 0; l < 2; ++l)
						dp[i][j][k][l] = INF;

		priority_queue<P> q;
		for (int i = 0; i < 2; ++i)
		{
			q.push(P(0, 0, 2, i, 0));
			dp[0][0][2][i] = 0;
		}

		int res;
		while (!q.empty())
		{
			P cc = q.top(); q.pop();
			int p = cc.p, l = cc.l, r = cc.r, t = cc.t, c = cc.c;
			if (c > dp[p][l][r][t])
				continue;
			else if (p == n)
			{
				res = c;
				break;
			}

			int x = (s[p] - '0' - 1) % 3;
			int nl = l, nr = r;
			if (t == 0)
				nl = x;
			else
				nr = x;

			int nc = c;
			int np = p + 1, nt = t ^ 1;
			if (nl > nr)
			{
				++nc;
				swap(nl, nr);
				nt ^= 1;
			}

			if (nc < dp[np][nl][nr][nt])
			{
				dp[np][nl][nr][nt] = nc;
				q.push(P(np, nl, nr, nt, nc));
			}
		}

		cout << res << endl;
	}
}

Measured memory_bytes: 8168