#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    string s;
    cin >> s;

    ll hole = 0;
    for(char c : s){
        if(c=='0' || c=='4' || c=='6' || c=='9'){
            hole++;
        }
        else if(c=='8'){
            hole += 2;
        }
    }

    ll answer0 = s.size() * 2 + 1 + hole;
    ll answer1 = 2 * (hole + 1) + s.size(); 

    ll m = min(answer0, answer1);
    p(m);
    
    return 0;
}