#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
vl v={3,2,2,2,3,2,3,2,4,3};
vl cst={1,0,0,0,1,0,1,0,2,1};
vl conv(ll n){
    vl v={n/9,(n/3)%3,n%3};
    return v;
}
int main(){
    string s;cin >> s;
    ll x=0,y=0;
    rep(i,s.size()){
        x++;
        y+=cst[s[i]-'0'];
    }
    ll base=27;
    vvl mat(27,vl(27,INF));
    rep(i,27){
        vl v=conv(i);
        if(v[0]==v[1])continue;
        if(v[2]==v[1])continue;
        rep(j,27){
            vl p=conv(j);
            if(p[0]==p[1])continue;
            if(p[2]==p[1])continue;
            ll cs=0;
            rep(k,3){
                if(p[k]!=v[k])cs|=1<<k;
            }
            if(cs==1){
                mat[i][j]=1;
            }
            else if(cs==2){
                mat[i][j]=x;
            }
            else if(cs==4){
                mat[i][j]=y;
            }
        }
    }
    rep(k,base)rep(i,27)rep(j,27)chmin(mat[i][j],mat[i][k]+mat[k][j]);
    cout << mat[3][10] << endl;
}