#include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <vector> #include <cstring> #include <string> #include <set> #include <map> #include <stack> #include <queue> #include <algorithm> #include <ctime> using namespace std; #define REP(i,n) for(int i=0; i<n; ++i) #define FOR(i,a,b) for(int i=a; i<=b; ++i) #define FORR(i,a,b) for (int i=a; i>=b; --i) #define ALL(c) (c).begin(), (c).end() typedef long long ll; typedef vector<int> VI; typedef vector<ll> VL; typedef vector<VI> VVI; typedef pair<int,int> P; typedef pair<ll,ll> PL; int main() { int a[] = {1,0,0,0,1,0,1,0,2,1}; string s; cin >> s; int ans = 1, ans2 = 2; REP(i,s.length()){ ans += 2 + a[s[i]-'0']; ans2 += 1 + 2*a[s[i]-'0']; } cout << min(ans, ans2) << endl; return 0; }