#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010


int main(){
  int p[] = {1,0,0,0,1,0,1,0,2,1};

  int n;

  scanf("%d",&n);

  if(n == 0){
    puts("4");
    return 0;
  }

  int ans = 0;
  
  while(n > 0){
    ans += p[n%10] + 2;
    n/=10;
  }

  printf("%d\n",ans+1);
  
  return 0;
}