#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod1 = 1e9 + 7;
const int mod2 = 998244353;
const int mod3 = 1e9;
const double PI = acos(-1);
const double eps = 1e-3;
const int sq5 = 616991993;
int t;
const int maxn = 1e6 + 10;
char s[maxn];
int pre[maxn];
int main() {
  cin >> t;
  while (t--) {
    scanf("%s", s + 1);
    int n = strlen(s + 1);
    for (int i = 1; i <= n; ++i) {
      pre[i] = pre[i - 1] + ((s[i] == '+') ? (1) : (-1));
    }
    cout << endl;
    int last = -1;
    long long res = 0;
    for (int i = 1; i <= n; ++i) {
      if ((last == -1 || pre[i] < pre[last]) && (pre[i] < 0)) {
        res = res + (long long)i * (pre[last] - pre[i]);
        last = i;
      }
    }
    printf("%lld\n", res + n);
  }
  return 0;
}
