Problem: Polycarpus just has been out of luck lately! As soon as he found a job in the "Binary Cat" cafe, the club got burgled. All ice-cream was stolen.

On the burglary night Polycarpus kept a careful record of all club visitors. Each time a visitor entered the club, Polycarpus put down character "+" in his notes. Similarly, each time a visitor left the club, Polycarpus put character "-" in his notes. We know that all cases of going in and out happened consecutively, that is, no two events happened at the same time. Polycarpus doesn't remember whether there was somebody in the club at the moment when his shift begun and at the moment when it ended.

Right now the police wonders what minimum number of distinct people Polycarpus could have seen. Assume that he sees anybody coming in or out of the club. Each person could have come in or out an arbitrary number of times.

Input

The only line of the input contains a sequence of characters "+" and "-", the characters are written one after another without any separators. The characters are written in the order, in which the corresponding events occurred. The given sequence has length from 1 to 300 characters, inclusive.

Output

Print the sought minimum number of people

Examples

Input

+-+-+


Output

1


Input

---

Output

3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const long double pi = fabsl(atan2l(0.0, -1.0));
const long double eps = 1e-9;
const int inf = 1 << 28;
using namespace std;
string s;
void load() { cin >> s; }
void solve() {
  string t = "";
  int o = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '+') o++;
    if (s[i] == '-') {
      if (o == 0)
        t += '+';
      else
        o--;
    }
  }
  s = t + s;
  while (o) {
    s += '-';
    o--;
  }
  int result = 0;
  for (int i = 0; i < s.size(); i++) {
    result = max(result, o);
    if (s[i] == '+')
      o++;
    else if (s[i] == '-')
      o--;
    result = max(result, o);
  }
  cout << result << "\n";
}
int main() {
  load();
  solve();
  return 0;
}