Let's denote a function f(x) in such a way: we add 1 to x, then, while there is at least one trailing zero in the resulting number, we remove that zero. For example, 

  * f(599) = 6: 599 + 1 = 600 → 60 → 6; 
  * f(7) = 8: 7 + 1 = 8; 
  * f(9) = 1: 9 + 1 = 10 → 1; 
  * f(10099) = 101: 10099 + 1 = 10100 → 1010 → 101. 



We say that some number y is reachable from x if we can apply function f to x some (possibly zero) times so that we get y as a result. For example, 102 is reachable from 10098 because f(f(f(10098))) = f(f(10099)) = f(101) = 102; and any number is reachable from itself.

You are given a number n; your task is to count how many different numbers are reachable from n.

Input

The first line contains one integer n (1 ≤ n ≤ 10^9).

Output

Print one integer: the number of different numbers that are reachable from n.

Examples

Input


1098


Output


20


Input


10


Output


19

Note

The numbers that are reachable from 1098 are:

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 1098, 1099.
# -*- coding: utf-8 -*-
"""
Created on Mon Apr 22 16:05:55 2019

@author: Aman Seth


st=input()
le=len(st)
if 'a' in st:
    ins=st.rfind('a')
    st1=st[0:ins+2]
    re=st[ins+2:le]
    ans=st1.replace('a','')
    if ans==re:
        print(st1)
    else:
        print(":(")
else:
    if all(st[i]!=st[i+1] for i in range(le-1)):
        print(st[0:int(le/2)])
if all(i!='a' for i in st):
    if all(st[i]==st[i+1] for i in range(le-1)):
        print(":(")

n,q=map(int,input().split())
a=list(map(int,input().split()))
le=len(a)
#c=['0']*le
#st=''
for i in range(q):
    x,y=input().split()
    y=int(y)
    if x=='>':
        for j in range(le):
            if a[j]>y:
                a[j]=-a[j]
                #c[j]=str(a[j])
                #st=st+str(a[j])+' '
    if x=='<':
        for j in range(le):
            if a[j]<y:
                a[j]=a[j]
                #c[j]=str(a[j])
                #st=st+str(a[j])+' '
#for j in range(le):
#    a[j]=str(a[j])
print(' '.join(map(str,a)))
#print(st)

n,q=map(int,input().split())
a=list(map(int,input().split()))
le=len(a)
for i in range(q):
    x,y=input().split()
    y=int(y)
    if x=='>':
        for j in range(le):
            if a[j]>y:
                a[j]=-a[j]
    if x=='<':
        for j in range(le):
            if a[j]<y:
                a[j]=-a[j]
#for j in range(len(a)):
#    a[j]=str(a[j])
print(' '.join(map(str,a)))

m,x,y=map(int,input().split())
ans=[]
for i in range(0,m+1):
    a=i
    count=0
    if a+x<=a and a+x>=0 and (a+x and a-y not in ans):
        count+=1
        ans.append(count)
        if a-y<=m and a-y>=0:
            count+=1
            ans.append(count)
print(ans)


def fun(a,b,n):
    #s=a+b
    ans=[a,b]
    i=0
    n=int(n)
    s=''
    while(len(s)<n):
        s=a[i]+a[i+1]
        ans.append(s)
    print(ans)


for i in range(int(input())):
    a,b,n=map(str,input().split())
    fun(a,b,n)
"""
n=input()
print(9+sum(9-int(d)for d in n[1:])+(len(n)>1))