#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
int main()
{
    string s;
    cin >> s;

    int a[10] = {4, 3, 3, 3, 4, 3, 4, 3, 5, 4};
    int ans = 0;
    rep(i, s.size())
    {
        ans += a[s[i] - '0'];
    }
    cout << ans - s.size() + 1 << endl;
}