#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using dl = double;
const int N = 2e5 + 10;
ll aarray[200000 + 10];
ll magic[101][101];
vector<ll> primes;
bool prime[1000001];
int main() {
  ios_base::sync_with_stdio(false);
  string str;
  ll a, b, c, d, e, f, x, y, k, t, A = 0, B = 0, L, j, i, l, r, m, n, C = 0,
                                   ans = 0, sum = 0, sum1 = 0;
  vector<ll> v, v1;
  queue<ll> qu;
  cin >> t;
  while (t--) {
    cin >> str;
    ll cur = 0, res = 0;
    bool ok = true;
    for (i = 0; i < str.length(); i++) {
      if (str[i] == '+')
        cur++;
      else
        cur--;
      if (cur < 0) {
        res += i + 1;
        cur++;
      }
    }
    res += str.length();
    cout << res << endl;
  }
  return 0;
}
