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.io.BufferedReader;
import java.io.InputStreamReader;

public class Main
{

  public static void main
  (
    String[] args
  )
  {
    BufferedReader in_stream;

    String  in_num;
    boolean is_all_9;
    int     cnt;
    int     len;
    int     ans;

    try
    {
      in_stream = new BufferedReader(new InputStreamReader(System.in));

      in_num = new String(in_stream.readLine());


      ans = 0;
      len = in_num.length();

      if(1 == len)
      {
        ans = Integer.parseInt(in_num);
      }
      else
      {

        is_all_9 = true;
        for(cnt=0; cnt<len; cnt++)
        {
          if(!in_num.substring(cnt, cnt+1).equals("9"))
          {
            is_all_9 = false;
            break;
          }
        }

        if(is_all_9)
        {
          ans = 9 * len;;
        }
        else
        {
          ans  = 9 * (len - 1);
          ans += ( Integer.parseInt(in_num.substring(0, 1)) - 1);
        }
      }

      System.out.println("" + ans);
    }
    catch(Exception e)
    {
      e.printStackTrace();
    }
  }
}