#include<iostream>
#include<string>
using namespace std;
int main(){
	
	int n,ans=0,ke=1;
	string s;
	cin>>n;
	s=to_string(n);
	for(int i=0;i<s.size();i++){
		ans+=(s[i]-'0');
		ke*=10;
	}
    ke/=10;
	if(n==ke)ans=10;
	cout<<ans<<endl;
	return 0;
}
### Prompt

Generate a Cpp solution to the following problem:

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".

Examples

Input

15


Output

6


Input

100000


Output

10

### Response

```cpp
#include<iostream>
#include<string>
using namespace std;
int main(){
	
	int n,ans=0,ke=1;
	string s;
	cin>>n;
	s=to_string(n);
	for(int i=0;i<s.size();i++){
		ans+=(s[i]-'0');
		ke*=10;
	}
    ke/=10;
	if(n==ke)ans=10;
	cout<<ans<<endl;
	return 0;
}
```