#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize "Ofast"

#define FR(i, n) for(int i = 0; i < (n); i++)

const int MN = 5005;
int n;
string str;
short oldDp[2][MN], newDp[2][MN];

int main(){
    cin.sync_with_stdio(0); cin.tie(0);
    int t; cin >> t;
    while(t--){
        cin >> str;
        n = str.size();
        FR(s, 2) FR(i, 16) newDp[s][i] = n;
        newDp[0][0] = 0;

        FR(p, n){
            FR(s, 2) FR(i, p+3) oldDp[s][i] = newDp[s][i], newDp[s][i] = n;
            if(str[p] != '<') FR(i, p+1){
                newDp[1][i+1] = min(oldDp[0][i], oldDp[1][i]);
            }
            if(str[p] != '>'){
                FR(i, p+1) newDp[0][i] = min({oldDp[0][i+1], short(oldDp[1][i]+1), short(oldDp[1][i+1]+1), short(oldDp[1][i+2]+1)});
                newDp[0][0] = min<short>(newDp[0][0], oldDp[0][0]+1);
            }
        }

        int res = n;
        FR(s, 2) FR(i, n+1) res = min(res, newDp[s][i]+i);
        cout << n-res << '\n';
    }
}