#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
const long long mod = 998244353;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long binpow(long long a, long long b, long long m) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
void solve() {
  string s;
  cin >> s;
  long long res = 0;
  long long n = s.size();
  long long l = 0, r = 1e7, m, ans = 0;
  while (l <= r) {
    m = l + r >> 1;
    int w = m, ok = 1;
    for (int i = 0; i < n; i++) {
      if (s[i] == '-') {
        w--;
      } else
        w++;
      if (w < 0) {
        ok = false;
        break;
      }
    }
    if (ok) {
      ans = m;
      r = m - 1;
    } else
      l = m + 1;
  }
  long long mn = 0, aux = 0;
  for (int i = 0; i < n; i++) {
    res += ans + 1;
    if (s[i] == '-')
      aux--;
    else
      aux++;
    if (mn > aux) {
      ans--;
      mn = aux;
    }
  }
  cout << res << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
