#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

int n;
int ans;
int num;

int main()
{
	cin >> n;

	string s = to_string(n);
	int len = s.size();
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == '6' || s[i] == '4' || s[i] == '9' || s[i] == '0') {
			ans += 3;
			num++;
		}
		else if (s[i] == '8') {
			ans += 4;
			num += 2;
		}
		else ans+=2;
	}

	cout << min(ans+1,(num+1)*2 + len) << endl;
	return	0;
}