#include <bits/stdc++.h>

using namespace std;

const int N = 1e4 + 5, P = 998244353;

int f[N][N][2];

void upd(int &x, int y) {
    (y < x) && (x = y);
}

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        string s, S; cin >> s;
        int n = s.size(), tn = n;
        for (int i = 0; i < n; ++i) {
            S += '?';
            S += s[i];
        }
        S += '?';
        n = S.size(), S = ' ' + S + ' ';
        for (int i = 0; i <= n; ++i) {
            for (int j = 0; j <= i; ++j) {
                f[i][j][0] = f[i][j][1] = 1e9;
            }
        }
        f[0][0][1] = 0;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j <= i; ++j) {
                for (int k = 0; k < 2; ++k) {
                    for (int l = 0; l < 3; ++l) {
                        if ((S[i + 1] == '<' && l == 0) || (S[i + 1] == '>' && l == 1) || (((i & 1) || j != 0) && l == 2)) {
                            continue;
                        }
                        int tj = j + (l == 0 ? 1 : (l == 1 ? -1 : 0));
                        if (~tj) upd(f[i + 1][tj][min(l, 1)], f[i][j][k] + (k == 0 && l == 1));
                    }
                }
            }
        }
        printf("%d\n", tn - f[n][0][1]);
    }
    return 0;
}