#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n;
    cin>>n;
    int hole[]={1,0,0,0,1,0,1,0,2,1};
    int holes=0;
    int digit=0;
    if (n==0) {
        holes++;
        digit++;
    }
    while (n) {
        holes+=hole[n%10];
        digit++;
        n/=10;
    }
    cout<<min(2*digit+holes+1,2*(holes+1)+digit)<<endl;
    return 0;
}