#include<bits/stdc++.h>
using namespace std;
template<class T1,class T2> bool cmax(T1& a,const T2& b){return a<b?a=b,1:0;}
template<class T1,class T2> bool cmin(T1& a,const T2& b){return b<a?a=b,1:0;}
#define fir(i,x,y,...) for(int i(x),##__VA_ARGS__;i<=(y);i++)
#define firr(i,x,y,...) for(int i(x),##__VA_ARGS__;i>=(y);i--)
#define fird(i,x,y,d,...) for(int i(x),##__VA_ARGS__;i<=(y);i+=(d))
#define firrd(i,x,y,d,...) for(int i(x),##__VA_ARGS__;i>=(y);i-=(d))
#define Yes cout<<"Yes\n"
#define No cout<<"No\n"
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define endl "\n"
#define ll long long
#define ull unsigned long long
int T;
bool _mul=1;
ll gcd(ll x,ll y){if(!y) return x;return gcd(y,x%y);}
ll power(ll b,ll p,ll mod){ll res=1;while(p){if(p&1) res=res*b%mod;b=b*b%mod;p>>=1;}return res;}
const int N=5005,inf=0x3f3f3f3f;
char s[N];
int n,f[N][N][3],ans;
void solve()
{
	ans=inf;
	cin>>(s+1);
	n=strlen(s+1);
	fir(i,0,n) fir(j,0,n) fir(k,0,2) f[i][j][k]=inf;
	f[0][0][2]=0;
	fir(i,1,n) fir(j,0,i-1) fir(k,0,2) fir(l,0,2)
	{
		if(s[i]=='<'&&l==2) continue;
		if(s[i]=='>'&&l==0) continue;
		cmin(f[i][j+l-1][l],f[i-1][j][k]+(l==1)+(k==2&&l==0));
	}
	fir(k,0,2) cmin(ans,f[n][0][k]);
	cout<<n-ans<<endl;
	return;
}
int main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin.tie(nullptr)->sync_with_stdio(false);
	if(_mul) cin>>T;
	else T=1;
	while(T--) solve();
	return 0;
}