Split — Eolymp

Input

The first line contains a single integer $n$ $(10 \leq n < 1 0^{2 \cdot 1 0^{5}})$ (10 \le n < 10^{2 \cdot 10^5}). It is guaranteed that the number does not contain leading zeros.

Note that the length of the representation of the number $n$ is from $2$ to $2 \cdot 1 0^{5}$ 2\cdot10^5 digits.

Output

You need to output a single integer — the maximum possible value of $a + b$ a + b from all possible splits.

Examples

Example 1

Loading

Example 2

Loading

Note

In the first test case, the maximum value is achieved by splitting $a = 1$ a = 1 and $b = 7031212$ b = 7031212.

In the second test case, the maximum value is achieved by splitting $a = 1$ a = 1 and $b = 923456789098765432$ b = 923456789098765432.

Scoring

Subtask $1$ ( $40$ points) : $(n < 1 0^{18})$ (n < 10^{18})
Subtask $2$ ( $60$ points) : No additional constraints