#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 ] ) ) ;
}
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;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgZGlnaXRzKGxvbmcgbik7CgppbnQgc29sdmUoY29uc3QgbG9uZyBuKSB7CgogIGxvbmcgY291bnRbNV0sIG1heD0wOwogIGNvdW50WzBdPW4vMiswLjU7CiAgCiAgZm9yKGNvdW50WzFdPTE7Y291bnRbMV08PWNvdW50WzBdO2NvdW50WzFdKyspewogICAgCiAgICBpZigoZGlnaXRzKGNvdW50WzFdKStkaWdpdHMobi1jb3VudFsxXSkpPm1heCkgCiAgICAgIG1heD0oZGlnaXRzKGNvdW50WzFdKStkaWdpdHMobi1jb3VudFsxXSkpOwogICAgCiAgfQogIHByaW50ZigibiA9ICVsZCwgbWF4ID0gJWxkXG4iLCBuLCBtYXgpOwogIHJldHVybiAoaW50KW1heDsKCn0KaW50IGRpZ2l0cyhsb25nIG4pewogIGxvbmcgZGlnaXQ9MDsKICB3aGlsZShuPjkpewogICAgZGlnaXQrPW4lMTA7CiAgICBuLz0xMDsKICB9CiAgcmV0dXJuIGRpZ2l0K247Cn0=