#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
	int n,s=0;
	cin>>n;
	for(int i=0;i<10;i++)s+=n%10,n/=10;
	cout<<(s>1?s:10)<<endl;
}
### Prompt

Please provide a Cpp coded solution to the problem described below:

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<algorithm>
#include<cmath>
using namespace std;
int main()
{
	int n,s=0;
	cin>>n;
	for(int i=0;i<10;i++)s+=n%10,n/=10;
	cout<<(s>1?s:10)<<endl;
}
```