#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

const int mxn = 500;

int n;
string s;
int dp[mxn][mxn][2];
//dp[x][x][0] = prev >
//dp[x][x][1] = prev <

int go(string &s) {
	n = sz(s);
	for (int i=0; i<=n; i++) {
		for (int j=0; j<=n; j++) {
			dp[i][j][0] = -mxn*mxn;
			dp[i][j][1] = -mxn*mxn;
		}
	}
	dp[0][0][0] = 0;
	for (int i=0; i<n; i++) {
		for (int j=0; j<n; j++) {
//			if (dp[i][j][0] != -1) {
				if (s[i] != '<') {
					dp[i+1][j+1][0] = max(dp[i+1][j+1][0], dp[i][j][0]);
					dp[i+1][j+1][0] = max(dp[i+1][j+1][0], dp[i][j][1]);
				}
				if (s[i] != '>') {
					if (j) {
						dp[i+1][j-1][1] = max(dp[i+1][j-1][1], dp[i][j][0]+1);
						dp[i+1][j-1][1] = max(dp[i+1][j-1][1], dp[i][j][1]+2);
					} else {
						dp[i+1][j][1] = max(dp[i+1][j][1], dp[i][j][0]);
						dp[i+1][j][1] = max(dp[i+1][j][1], dp[i][j][1]);
					}
					if (j >= 2) {
						dp[i+1][j-2][1] = max(dp[i+1][j-2][1], dp[i][j][0]+2);
						dp[i+1][j-2][1] = max(dp[i+1][j-2][1], dp[i][j][1]+3);
					}
				}
//			}
		}
	}
	
	int mx = 0;
	for (int i=0; i<=n; i++) {
		mx = max(mx, dp[n][i][0]);
		mx = max(mx, dp[n][i][1]);
		if (i) {
			mx = max(mx, dp[n][i][1]+1);
		}
	}
	return mx;
}

void solve() {
	cin>>s;
	int res = go(s);
	reverse(all(s));
	for (int i=0; i<sz(s); i++) {
		if (s[i]=='>') s[i]='<';
		else if (s[i]=='<') s[i]='>';
	}
	res = max(go(s),res);
	cout<<res<<"\n";
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	int t; cin>>t;
	while (t--) {
		solve();
	}
	
	return 0;
}