package mindCoding;

import java.io.FileNotFoundException;
import java.util.List;
import java.util.logging.Level;
import java.util.logging.Logger;

public class Main {
	public static void main(String[] args){
		try{
			Config c = new Config("data.txt");
			int n = c.getN();
			int[] ar = new int[7];
			int[] dig = new int[10];
			int i = 0;
			int dig8 = n%10000000;
			while(dig8 != 0){
				ar[i] = dig8 % 10;
				dig8 /=10;
				i++;
			}
			for( i=0;i<dig.length;i++){
				for(int j = 0;j<ar.length;j++){
					if(i == ar[j])
						dig[i]++;
				}
			}
			int comb= 0;
			for( i=0;i<dig.length;i++){
				switch(dig[i]){
				case 0: comb+=8;
				break;
				case 1: comb+=7;
				break;
				case 2: comb+=6;
				break;
				case 3: comb+=5;
				break;
				case 4: comb+=4;
				break;
				case 5: comb+=3;
				break;
				case 6: comb+=2;
				break;
				}
			}
			System.out.println(comb);
			
		}
		catch (FileNotFoundException ex) {
			Logger.getLogger(Main.class.getName()).log(Level.SEVERE, null, ex);
			
		}
	}

	public static int[] indexes(String ta, String tb,List<String> l){
		
		int[] ind= new int[2];
		for(String a: l)
		{
			if(ta == a)
				ind[0] = l.indexOf(a);
			break;
		}
		for(String a: l)
		{
			if(tb == a)
				ind[1] = l.indexOf(a);
			break;
		}
		return ind;
	}
	public static int[] winner(int[] scores,int[] ind, int ga, int gb ){
		if(ga>gb)
			scores[ind[0]]+=3;
		if(ga<gb)
			scores[ind[1]]+=3;
		if(ga==gb){
			scores[ind[0]]++;
			scores[ind[1]]++;
		}
		return scores;
	}
	public static int[] goals(int[] goals,int[] ind, int ga, int gb ){
		goals[ind[0]] +=ga;
		goals[ind[1]] +=gb;
		return goals;
	}
	public static String peculiar(int a, int b, List<Integer> l)
	{
		String s = "NO";
		if(b==0)
			return "YES";
		if(a==b)
			return "YES";
		if((a%10 == b/10) && (a/10 == b%10))
			return "YES";
		if(a%10 == a/10+1 && b/10 == a/10 +2 && b%10 == a/10+3)
			return "YES";
		int n = a * 100 + b;
		for (int num : l) {
			if(num == n)
				return "YES";
		}
		 
		return s;
	}
}