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.Scanner;

public class Main {

	public static void main(String[] args) {
		Main m = new Main();
		m.run();
	}

	Scanner sc = new Scanner(System.in);

	void run() {
		
		long n = sc.nextLong();
		
		System.out.println(solve(n));
		
	}
	
	long solve(long n){
		long x = n;
		int r = 0;
		
		long d1 = 1;
		boolean isNine = true;
		for(;x > 0;){
			if(x % 10 != 9){
				isNine = false;
			}
			r += x % 10;
			x = x / 10;
			d1 *= 10;
		}
		d1 /= 10;
		/*
		System.out.println(isNine);
		System.out.println(r);
		System.out.println(d1);
		*/
		if(isNine){
			return r;
		}
		
		return digitSum(d1-1 + (n/d1 - 1) * d1);
	}
	
	int digitSum(long n){
		int r = 0;
		for(;n > 0;){
			r += n%10;
			n /= 10;
		}
		return r;
	}
}