#include <iostream>
#define REP(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;

long table[10] = { 1, 0, 0, 0, 1, 0, 1, 0, 2, 1 };

int main(void) {
  string s; cin >> s;

  long p = s.length() * 2 + 1;
  REP(i, 0, s.length()) {
    p += table[s[i] - '0'];
  }
  long q = s.length() + 2;
  REP(i, 0, s.length()) {
    q += table[s[i] - '0'] * 2;
  }

  cout << min(p, q) << endl;

  return 0;
}