#include "bits/stdc++.h" #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define DESCSORT(c) sort(c.begin(), c.end(), greater()) using namespace std; using LL = long long int; using LD = long double; using pii = pair; using pll = pair; using pdd = pair; using vi = vector; using vvi = vector; using vvvi = vector; using vl = vector; using vvl = vector; using vvvl = vector; using vd = vector; using vvd = vector; using vs = vector; using vb = vector; using vvb = vector; const int INF = (1 << 30) - 1; const LL INF64 = ((LL)1 << 62) - 1; const double PI = 3.1415926535897932384626433832795; const int dy[] = { 0, 1, 0, -1 }; const int dx[] = { 1, 0, -1, 0 }; int gcd(int x, int y) { return y ? gcd(y, x % y) : x; } LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; } int toolCnt(char c) { if (c == '0') { return 4; } else if (c == '1') { return 3; } else if (c == '2') { return 3; } else if (c == '3') { return 3; } else if (c == '4') { return 4; } else if (c == '5') { return 3; } else if (c == '6') { return 4; } else if (c == '7') { return 3; } else if (c == '8') { return 5; } else if (c == '9') { return 4; } return 0; } int main() { ios::sync_with_stdio(false); cin.tie(0); string s; cin >> s; int n = s.size(); LL ans = 0; if (n == 1) { for (int i = 0; i < n; i++) { ans += toolCnt(s[i]); } cout << ans << endl; } else { ans += n + 1; for (int i = 0; i < n; i++) { int val = toolCnt(s[i]); if (val == 4) { ans++; } else if (val == 5) { ans += 2; } } ans += n; cout << ans << endl; } return 0; }