#include <iostream>
#include <algorithm>
using namespace std;

int main(){
  	string n;
  	cin >> n;
  	int hole[10] = {1, 0, 0, 0, 1, 0, 1, 0, 2, 1};
  	int hole_all = 1;
  	for(int i = 0; i < n.size(); i++){
    	hole_all += hole[n[i] - '0'];
    }
  	cout << min(hole_all, int(n.size())) + hole_all + n.size() << endl;
}