#include<bits/stdc++.h>
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=5e3+10,inf=1e7;
int f[Maxn][Maxn][2];
char c[Maxn];
int n;
inline void chkmin(int &x,int y){if(x>y) x=y;}
inline void work(){
    scanf("%s",c+1);n=strlen(c+1);
    fr(i,0,n) fr(j,0,n) f[i][j][0]=f[i][j][1]=inf;
    f[0][0][0]=0;
    fr(i,0,n-1) fr(j,0,n) fr(p,0,1){
        if(f[i][j][p]==inf) continue;
        if(c[i+1]!='>'){
            if(j>0) chkmin(f[i+1][j-1][0],f[i][j][p]);
            else chkmin(f[i+1][0][0],f[i][j][p]+1);
        }
        if(c[i+1]!='<'){
            if(p==0){
                chkmin(f[i+1][j][1],f[i][j][p]+1);
                chkmin(f[i+1][j+1][1],f[i][j][p]+1);
                chkmin(f[i+1][j+2][1],f[i][j][p]+1);
            }
            else chkmin(f[i+1][j+1][1],f[i][j][p]);
        }
    }
    // fr(i,0,n) fr(j,0,n) fr(p,0,1) if(f[i][j][p]!=inf) cout<<i<<' '<<j<<' '<<p<<' '<<f[i][j][p]<<endl;
    writeln(n-min(f[n][0][0],f[n][0][1]));
}
inline void init(){
    int t=read();
    while(t--) work();
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}