#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;


int main(void) {

  string s;
  cin >> s;

  int n[10] = {1,0,0,0,1,0,1,0,2,1};

  int ans = s.size() * 2;
  int tmp = 0;
  for(int i=0; i<s.size(); i++){
    tmp += n[ s[i]-'0' ];
  }
  ans += tmp;
  ans += 1;
  int q = (tmp+1)*2 + s.size();
  ans = min(ans, q );
  cout << ans << endl;

  return 0;
}






// EOF