Problem:
Score : 200 points

Problem Statement

Takahashi has two positive integers A and B.

It is known that A plus B equals N.
Find the minimum possible value of "the sum of the digits of A" plus "the sum of the digits of B" (in base 10).

Constraints

2 ≤ N ≤ 10^5

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the minimum possible value of "the sum of the digits of A" plus "the sum of the digits of B".

Sample Input 1

15

Sample Output 1

6

When A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.

Sample Input 2

100000

Sample Output 2

10

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

package main;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N=sc.nextInt();
		int A,B,min=100000;
		int Asum=0,Bsum=0;
		for(A=0;A<N;A++) {
			B=N-A;
			if(A>10000) {Asum+=(A%100000)/10000;}
			if(A>1000) {Asum+=(A%10000)/1000;}
			if(A>100) {Asum+=(A%1000)/100;}
			if(A>10) {Asum+=(A%100)/10;}
			Asum+=A%10;
			
			if(B>10000) {Bsum+=(B%100000)/10000;}
			
			if(B>1000) {Bsum+=(B%10000)/1000;}
			if(B>100) {Bsum+=(B%1000)/100;}
			if(B>10) {Bsum+=(B%100)/10;}
			Bsum+=B%10;
			if((Asum+Bsum)<min) {min=Asum+Bsum;}
		}
		System.out.print(min);
		//for(int i=0;i<3;i++) {

		//}
		}
	}