#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=5000+5,M=2000+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-8;const int INF=1e9+7;mt19937 rnd(181766);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,k,dp[N][N][2];
char s[N];
void chkmin(int &x,int y){if(x>y) x=y;}
void add1(int x){
	for(int i=1;i<=x+1;i++) chkmin(dp[x][i][0],dp[x-1][i-1][0]);
}
void add2(int x){
	for(int i=x+1;i;i--) chkmin(dp[x][i-1][1],dp[x-1][i][1]);
}
void Solve(){
	int i,j;scanf("%s",s+1);n=strlen(s+1);
	for(i=0;i<=n;i++) for(j=0;j<=i+2;j++) Me(dp[i][j],0x3f);
	dp[0][1][0]=dp[0][1][1]=0;
	for(i=1;i<=n;i++){
		if(s[i]^'<') add1(i);
		if(s[i]^'>') add2(i);
		for(int j=0;j<=i+1;j++){
			chkmin(dp[i][j][1],dp[i][j][0]);
			chkmin(dp[i][j][0],dp[i][j][1]+1);
			chkmin(dp[i][j+1][0],dp[i][j][1]+1);
			if(j) chkmin(dp[i][j-1][0],dp[i][j][1]+1);
		}
		Me(dp[i][0],0x3f);
		gdb(dp[i][1][0]);
	}
	printf("%d\n",n-dp[n][1][0]);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}