#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

int T, n, f[5010][5010][2], ans;
string s;

int main(){
  cin >> T;
  while(T--){
    ans = -1e9;
    cin >> s;
    n = s.size();
    for(int i = 0; i <= n; i++){
      for(int j = 0; j <= n; j++){
        f[i][j][0] = f[i][j][1] = -1e9;
      }
    }
    f[0][0][1] = 0;
    for(int i = 1; i <= n; i++){
      if(s[i - 1] != '>') f[i][0][1] = f[i - 1][0][1];
      if(s[i - 1] != '<') f[i][1][0] = f[i - 1][0][1];
      for(int j = 1; j < i; j++){
        if(s[i - 1] != '<'){
          f[i][j][0] = max(f[i][j][0], f[i - 1][j][1] + 1);
          f[i][j + 1][0] = max(f[i][j + 1][0], f[i - 1][j][0]);
        }
        if(s[i - 1] != '>'){
          f[i][j][1] = max(f[i][j][1], f[i - 1][j][0]);
          f[i][j - 1][1] = max(f[i][j - 1][1], max(f[i - 1][j][1] + 2, f[i - 1][j][0] + 1));
        }
      }
    }
    for(int i = 0; i <= n; i++){
      ans = max(ans, max(f[n][i][0], f[n][i][1] + (i > 0)));
    }  
    cout << ans << "\n";
  }
  return 0;
}