Problem: Vasya plays Robot Bicorn Attack.

The game consists of three rounds. For each one a non-negative integer amount of points is given. The result of the game is the sum of obtained points. Vasya has already played three rounds and wrote obtained points one by one (without leading zeros) into the string s. Vasya decided to brag about his achievement to the friends. However, he has forgotten how many points he got for each round. The only thing he remembers is the string s.

Help Vasya to find out what is the maximum amount of points he could get. Take into account that Vasya played Robot Bicorn Attack for the first time, so he could not get more than 1000000 (106) points for one round.

Input

The only line of input contains non-empty string s obtained by Vasya. The string consists of digits only. The string length does not exceed 30 characters.

Output

Print the only number — the maximum amount of points Vasya could get. If Vasya is wrong and the string could not be obtained according to the rules then output number -1.

Examples

Input

1234


Output

37


Input

9000


Output

90


Input

0009


Output

-1

Note

In the first example the string must be split into numbers 1, 2 and 34.

In the second example the string must be split into numbers 90, 0 and 0. 

In the third example the string is incorrect, because after splitting the string into 3 numbers number 00 or 09 will be obtained, but numbers cannot have leading zeroes.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int L;
char s[50];
int f[50][4];
void solve() {
  scanf("%s", s + 1);
  L = strlen(s + 1);
  memset(f, -1, sizeof f);
  f[0][0] = 0;
  for (int i = 0; i < L; ++i)
    for (int j = 0; j < 3; ++j)
      if (f[i][j] >= 0) {
        if (s[i + 1] == '0') {
          f[i + 1][j + 1] = max(f[i + 1][j + 1], f[i][j]);
        } else {
          int x = 0;
          for (int k = i + 1; k <= min(L - (2 - j), L); ++k) {
            x = x * 10 + s[k] - '0';
            if (x > 1000000) break;
            f[k][j + 1] = max(f[k][j + 1], f[i][j] + x);
          }
        }
      }
  cout << f[L][3] << endl;
}
int main() {
  solve();
  return 0;
}