#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int main() {
	string n;
	cin >> n;
	REP(i, n.size()) n[i] -= '0';

	
	int ans = INF;

	int cnt[2][10] = {
	// 0,1,2,3,4,5,6,7,8,9
		{3,2,2,2,3,2,3,2,4,3},
		{3,1,1,2,3,1,3,1,5,3}
	};
	int st[2] = {1, 2};
	
	REP(i, 1<<n.size()) {
		int c[2] = {};
		REP(j, n.size()) c[i >> j & 1]++;
		
		int now = 0;
		if (c[0]) now += st[0];
		if (c[1]) now += st[1];
		
		REP(j, n.size()) now += cnt[i >> j & 1][n[j]];
		
		if (c[0] && c[1]) now += c[1];
		
		chmin(ans, now);
	}
	
	cout << ans << endl;
	
	return 0;
}