#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second

typedef long long ll;
#define int ll

using namespace std;

int n;
string s;
int dp[3030][3030][3];

bool can(int i, int dir)
{
    if (s[i] == '?')
        return true;
    return ((s[i] == '<') == (dir == 0));
}

int f(int i, int j, int b)
{
    if (dp[i][j][b] != -1)
        return dp[i][j][b];
    if (i == j)
    {
        if (b == 2) return dp[i][j][b] = -1e9;
        if (can(i, b)) return dp[i][j][b] = 0;
        else return -1e9;
    }

    int ans = -1e9;
    if (b == 0)
    {
        if (can(j, 0)) ans = max(ans, f(i, j-1, 0));
        if (can(j, 0)) ans = max(ans, max(f(i, j-1, 2), f(i, j-1, 1))+1);
    }
    else if (b == 1)
    {
        if (can(i, 1)) ans = max(ans, f(i+1, j, 1));
        if (can(i, 1)) ans = max(ans, max(f(i+1, j, 2), f(i+1, j, 0))+1);
    }
    else
    {
        for (int l=i; l<=j-1; l++)
            ans = max(ans, f(i, l, 0) + f(l+1, j, 1));
    }

    return dp[i][j][b] = ans;
}

void solve()
{
    cin>>s;
    n = s.size();
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
            dp[i][j][0] = dp[i][j][1] = dp[i][j][2] = -1;
    cout<<max({f(0, n-1, 0), f(0, n-1, 1), f(0, n-1, 2)})<<"\n";
}

main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin>>t;
    while (t--)
        solve();
}