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)

import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[]srgs) {
	Scanner scan=new Scanner(System.in);
	int a=scan.nextInt();
	long c[]=new long[a+1];
	long count=0;
	for(int i=1;i!=a+1;i++) {
		int b=scan.nextInt();
		count+=b;
		c[i]=count;
	}
	Arrays.sort(c);
	long co=0;
	for(int i=0;i!=a+1;i++) {
	}
	count=0;
	for(int i=0;i!=a;i++) {
		co++;
		if(c[i]!=c[i+1]) {
			count+=co*(co-1)/2;
			co=0;
		}
	}
	count+=(co+1)*(co)/2;
	System.out.println(count);
	}
}