#include <stdio.h>

int digits(long n);

int solve(const long n) {

  long count[5], max=0;
  count[0]=n/2+0.5;
  
 /* for(count[1]=1;count[1]<=count[0];count[1]++){
    
    if((digits(count[1])+digits(n-count[1]))>max) 
      max=(digits(count[1])+digits(n-count[1]));
    
  }*/
  count[1]=n;
  count[2]=0;
  while(count[1]>9){
    count[1]/=10;
    count[2]++;
  }
  count[3]=pow(10,count[2]);
  max=digits(count[3]-1)+digits(n-count[3]+1);
  
  printf("n = %ld, max = %ld\n", n, max);
  return (int)max;

}
int digits(long n){
  long digit=0;
  while(n>9){
    digit+=n%10;
    n/=10;
  }
  return digit+n;
}