#include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
typedef long long int LLI;
#define pb push_back
#define mp make_pair
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

char s[5001];
int dp[2][5001][2];
int pre[10005],suff[10005];
int main() {
    int i,j,k;
    int T,n;
    scanf("%d",&T);
    while (T--) {
        scanf("%s",s);
        n = strlen(s);

        auto f = [&](int *arr) {
            for (i = 0; i <= n; i++) dp[0][i][0] = dp[0][i][1] = 1e9;
            dp[0][1][1] = 0;
            arr[0] = 0;
            for (i = 1; i <= 2*n; i++) {
                for (j = 0; j <= n; j++) {
                    for (k = 0; k < 2; k++) dp[i & 1][j][k] = 1e9;
                }
                for (j = 0; j <= n; j++) {
                    for (k = 0; k < 2; k++) {
                        if (dp[(i-1) & 1][j][k] < 1e9) {
                            if (i & 1) {
                                if (s[(i-1)/2] != '>') {
                                    if (j > 0) dp[i&1][j-1][0] = min(dp[i&1][j-1][0],dp[(i-1)&1][j][k]+k);
                                }
                                if (s[(i-1)/2] != '<') {
                                    if (j < n) dp[i&1][j+1][1] = min(dp[i&1][j+1][1],dp[(i-1)&1][j][k]);
                                }
                            }
                            else {
                                if (j > 0) dp[i&1][j-1][0] = min(dp[i&1][j-1][0],dp[(i-1)&1][j][k]+k);
                                if (j < n) dp[i&1][j+1][1] = min(dp[i&1][j+1][1],dp[(i-1)&1][j][k]);
                            }
                        }
                    }
                }
                arr[i+1] = dp[i & 1][0][0];
            }
        };
        f(pre);
        reverse(s,s+n);
        for (i = 0; i < n; i++) {
            if (s[i] == '<') s[i] = '>';
            else if (s[i] == '>') s[i] = '<';
        }
        f(suff);
        reverse(suff,suff+2*n+1);
        int ans = 1e9;
        for (i = 0; i <= 2*n; i += 2) {
            ans = min(ans,pre[i]+suff[i]);
        }
        printf("%d\n",n-ans);
    }

    return 0;
}