#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <string>
#include <stack>
using ll = long long;
#define MOD 1000000007
using namespace std;

int main(){
    string n;
    ll cnt = 0;
    cin >> n;
    for(int i = 0; i < (int)n.length(); i++)
    {
        switch (n[i]) {
            case '0':
            case '4':
            case '6':
            case '9':
                cnt++;
                break;
            case '8':
                cnt+=2;
                break;
            default:
                break;
        }
    }
    cout << min(cnt + (ll)n.length() + 1 + (ll)n.length(),2*(cnt + 1) + (int)n.length()) << endl;
}