#agc021a. [agc021_a]Digit Sum 2
[agc021_a]Digit Sum 2
Problem Statement
Find the maximum possible sum of the digits (in base ) of a positive integer not greater than .
Constraints
- is an integer.
Input
Input is given from Standard Input in the following format:
Output
Print the maximum possible sum of the digits (in base ) of a positive integer not greater than .
Sample Input 1
100
Sample Output 1
18
For example, the sum of the digits in is , which turns out to be the maximum value.
Sample Input 2
9995
Sample Output 2
35
For example, the sum of the digits in is , which turns out to be the maximum value.
Sample Input 3
3141592653589793
Sample Output 3
137