Problem:
Score : 300 points

Problem Statement

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

Constraints

1\leq N \leq 10^{16}

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

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

Sample Input 1

100

Sample Output 1

18

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

Sample Input 2

9995

Sample Output 2

35

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

Sample Input 3

3141592653589793

Sample Output 3

137

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;
public class Main{
	public static void main(String[] args){
    	Scanner sc = new Scanner(System.in);
      String n = sc.next();
      int cnt = 0;
      for(int i = 0;i < n.length();i++)if(n.substring(i,i+1).equals("9"))cnt++;
      String m = n.substring(0,1);
      if(n.length()==1)System.out.println(n);
      else if(cnt==n.length())System.out.println(9*cnt);
      else if(cnt==n.length()-1&&!m.equals(9))System.out.println(Integer.parseInt(m)+9*(n.length()-1));
      else System.out.println(Integer.parseInt(m)-1+(n.length()-1)*9);
    }
}