#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { string s; cin >> s; int n = s.size(); int f[10] = {}; int ans = 0; rep(i,n){ f[s[i] - '0']++; } ans++; ans += f[0] + f[4] + f[6] + f[8] * 2 + f[9]; ans += n * 2; int tmp = 0; tmp++; tmp += f[0] + f[4] + f[6] + f[8] * 2 + f[9]; tmp += n; tmp++; tmp += f[0] + f[4] + f[6] + f[8] * 2 + f[9]; ans = min(ans, tmp); cout << ans << endl; return 0; }