#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define x first
#define y second

void solve();

int main() {
#ifndef LOCAL
	cin.tie(nullptr)->sync_with_stdio(false);
#endif
	cout << fixed << setprecision(30);
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}

const int N = 5000;

int dp[N][N][3]; //0 - mid, 1 - left, 2 - right


void solve() {
	string s;
	cin >> s;
	int n = s.size();
	for (int i = 0; i < n; ++i) {
		for (int j = i; j < n; ++j) {
			for (int c = 0; c < 3; ++c) {
				dp[i][j][c] = -1e9;
			}
		}
	}
	for (int i = 0; i < n; ++i) {
		if (s[i] != '<') {
			dp[i][i][2] = 0;
		}
		if (s[i] != '>') {
			dp[i][i][1] = 0;
		}
	}
	for (int len = 1; len < n; ++len) {
		for (int l = 0, r = len; r < n; ++l, ++r) {
			if (s[l] != '<') {
				for (int c = 0; c < 3; ++c) {
					dp[l][r][1] = max(dp[l][r][1], dp[l + 1][r][c] + (c != 1));
				}
			}
			if (s[l] != '>') {
				for (int c = 0; c < 3; ++c) {
					int q = (c == 2 ? 2 : 0);
					dp[l][r][q] = max(dp[l][r][q], dp[l + 1][r][c]);
				}
			}
			if (s[r] != '<') {
				for (int c = 0; c < 3; ++c) {
					int q = (c == 1 ? 1 : 0);
					dp[l][r][q] = max(dp[l][r][q], dp[l][r - 1][c]);
				}
			}
			if (s[r] != '>') {
				for (int c = 0; c < 3; ++c) {
					dp[l][r][2] = max(dp[l][r][2], dp[l][r - 1][c] + (c != 2));
				}
			}
		}
	}
	vector<int> dp2(n + 1, 0);
	for (int i = 0; i < n; ++i) {
		for (int j = i; j < n; ++j) {
			for (int c = 0; c < 3; ++c) {
				dp2[j + 1] = max(dp2[j + 1], dp2[i] + dp[i][j][c]);
			}
		}
	}
	cout << dp2.back() << '\n';
}