```cpp
#include <bits/stdc++.h>
#define ll long long
using namespace std;
string s;
int len;
int ans,bu[10][10] = {{},{-1,0,1,2,1,2,3,2,3,4},{-1,1,0,1,2,1,2,3,2,3},{-1,2,1,0,3,2,1,4,3,2},{-1,1,2,3,0,1,2,1,2,3},{-1,2,1,2,1,0,1,2,1,2},{-1,3,2,1,2,1,0,3,2,1},{-1,2,3,4,1,2,3,0,1,2},{-1,3,2,3,2,1,2,1,0,1},{-1,4,3,2,3,2,1,2,1,0}};//打表，bu[i][j]表示从i到j的最少步数
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> s;
	len = (int)s.size();
	int now = 1;
	for (int i = 0;i < len;i++)
	{
		int go = s[i] - '0';
		ans += bu[now][go];
		now = go;
	}
	cout << ans;
	return 0;
}
```