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.*;
import java.util.*;


public class Main {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		long n = sc.nextLong();

		int max = cnt(n);

		for (int i = 1; true; i++) {
			long tmp = n + 1;
			for (int j = 0; j < i; j++) {
				tmp /= 10;
			}
			tmp -= 1;
			if (tmp <= 0) {
				break;
			}
			for (int j = 0; j < i; j++) {
				tmp *= 10;
				tmp += 9;
			}

			max = Math.max(max, cnt(tmp));
		}

		pr.println(max);
	}

	private static int cnt(long n) {
		int cnt = 0;
		long tmp = n;
		while (tmp > 0) {
			cnt += tmp % 10;
			tmp /= 10;
		}

		return cnt;
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}