// !!!!!!
// rename to template.cpp instead of main.cpp
#include <bits/stdc++.h>

#define fr first
#define sc second
#define all(a) (a).begin(), (a).end()

using namespace std;

#ifdef ONPC
mt19937 rnd(223);
#else
mt19937 rnd(chrono::high_resolution_clock::now()
                    .time_since_epoch().count());
#endif

#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)
template<typename T, typename U>
ostream& operator << (ostream& o, const pair<T, U>& p) {
    return o << "(" << p.first << ", " << p.second << ")";
}
template<typename T>
ostream& operator << (ostream& o, const vector<T>& v) {
    bool first = true;
    o << "[";
    for (const auto& l : v) {
        if (!first) o << ", ";
        o << l;
        first = false;
    }
    return o << "]";
}
template<typename T>
ostream& operator << (ostream& o, const set<T>& v) {
    bool first = true;
    o << "{";
    for (const auto& l : v) {
        if (!first) o << ", ";
        o << l;
        first = false;
    }
    return o << "}";
}
#ifdef ONPC
#define show(x) cout << "LINE " << __LINE__ << ": " << #x << "=" << x << std::endl;
#else
#define show(x) 42
#endif

using ll = long long;
using ld = double;

void solve() {
    string s;
    cin >> s;
    int n = s.size();
    const int inf = 1e9;
    vector<vector<array<int, 3>>> dp(n, vector<array<int, 3>>(n, {inf, inf, inf}));
    // {left, middle, right}
    for (int i = 0; i < n; ++i) {
        if (s[i] == '<') {
            dp[i][i][2] = 1;
        } else if (s[i] == '>') {
            dp[i][i][0] = 1;
        } else {
            dp[i][i][0] = dp[i][i][2] = 1;
        }
    }
    for (int len = 2; len <= n; ++len) {
        for (int l = 0; l < n; ++l) {
            int r = l + len - 1;
            if (r >= n) break;
            for (int m = l; m < r; ++m) {
                dp[l][r][0] = min(dp[l][r][0], dp[l][m][0] + dp[m + 1][r][0]);
                dp[l][r][1] = min(dp[l][r][1], dp[l][m][1] + dp[m + 1][r][0]);
                dp[l][r][1] = min(dp[l][r][1], dp[l][m][2] + dp[m + 1][r][1]);
                dp[l][r][2] = min(dp[l][r][2], dp[l][m][2] + dp[m + 1][r][2]);
            }
            if (s[l] == '>' || s[l] == '?') {
                for (int b = 0; b < 3; ++b) {
                    dp[l][r][0] = min(dp[l][r][0], dp[l + 1][r][b] + (b == 0));
                }
            }
            if (s[l] == '<' || s[l] == '?') {
                for (int b = 0; b < 3; ++b) {
                    dp[l][r][max(1, b)] = min(dp[l][r][max(1, b)], dp[l + 1][r][b] + 1);
                }
            }
            if (s[r] == '<' || s[r] == '?') {
                for (int b = 0; b < 3; ++b) {
                    dp[l][r][2] = min(dp[l][r][2], dp[l][r - 1][b] + (b == 2));
                }
            }
            if (s[r] == '>' || s[r] == '?') {
                for (int b = 0; b < 3; ++b) {
                    dp[l][r][min(1, b)] = min(dp[l][r][min(1, b)], dp[l][r - 1][b] + 1);
                }
            }
        }
    }
    cout << n - *min_element(all(dp[0][n-1])) << '\n';
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0);
    cout << fixed << setprecision(20);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    cerr << "\n\nConsumed " << TIME << endl;
}