#agc021a. [agc021_a]Digit Sum 2

[agc021_a]Digit Sum 2

Problem Statement

Find the maximum possible sum of the digits (in base 1010) of a positive integer not greater than NN.

Constraints

  • 1leqNleq10161\\leq N \\leq 10^{16}
  • NN is an integer.

Input

Input is given from Standard Input in the following format:

NN

Output

Print the maximum possible sum of the digits (in base 1010) of a positive integer not greater than NN.


Sample Input 1

100

Sample Output 1

18

For example, the sum of the digits in 9999 is 1818, which turns out to be the maximum value.


Sample Input 2

9995

Sample Output 2

35

For example, the sum of the digits in 99899989 is 3535, which turns out to be the maximum value.


Sample Input 3

3141592653589793

Sample Output 3

137