#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<string>

using namespace std;

int main(){
	int hole[10] = {1,0,0,0,1,0,1,0,2,1};
	string n;
	cin >> n;
	int keta = n.length();
	vector<int> times;
	int precount = 0;
	int count = 0;

	for(int j=keta-1;j>=0;j--){
		int one = n[j] - '0';
		precount += hole[one];
	}
	
	if(precount >= keta){
		for(int i=keta-1;i>=0;i--){
			int one = n[i] - '0';
			count += hole[one];
			count ++;
			count ++;
		}
		count++;
	}else{
		for(int i=keta-1;i>=0;i--){
			int one = n[i] - '0';
			count += hole[one];
			count += hole[one];
			count ++;
		}
		count++;
		count++;
	}
	cout << count << endl;

  return 0;
}