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

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

int main() {

	cin >> n;
	if (n == 0) { cout << 4 << endl; return 0; }
	
	int hole = 0;
	int keta = 0;
	
	while (n > 0) {
		keta++;
		hole += cnt[n % 10];
		n /= 10;
	}
	hole++;
	cout << 2 * min(hole, keta) + max(hole, keta) << endl;
	return 0;
}