/**
 * @author n685
 * @brief
 * @date 2024-11-09 18:10:18
 *
 *
 */
#include "bits/stdc++.h"

#ifdef LOCAL
#include "dd/debug.h"
#else
#define dbg(...) 42
#define dbg_proj(...) 420
#define dbg_rproj(...) 420420
void nline() {}
void bar() {}
void start_clock() {}
void end_clock() {}
#endif

namespace rs = std::ranges;
namespace rv = std::views;

template <class T> constexpr T INF = T{};
template <std::floating_point T> constexpr T INF<T> = std::numeric_limits<T>::infinity();
template <> constexpr int INF<int> = 0x3f3f3f3f;                 // 1061109567
template <> constexpr int64_t INF<int64_t> = 0x3f3f3f3f3f3f3f3f; // 4557430888798830399

template <class T> bool ckmin(T& a, const T& b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool ckmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

void solve() {
  std::string s;
  std::cin >> s;
  int n = static_cast<int>(s.size());
  using Arr = std::vector<std::array<int, 2>>;
  const Arr id = std::vector<std::array<int, 2>>(n + 1, std::array<int, 2>{INF<int>, INF<int>});
  std::array<Arr, 2> dp{};
  dp[0] = id;
  dp[0][0][0] = 0;
  for (int i = 0; i < n; ++i) {
    dp[1] = id;
    for (int j = 0; j <= n; ++j) {
      if (s[i] != '>') {
        ckmin(dp[1][j][0], dp[0][j][0] + 1);
        ckmin(dp[1][j][0], dp[0][j][1] + 1);
        if (j > 0) {
          ckmin(dp[1][j - 1][0], dp[0][j][0]);
          ckmin(dp[1][j - 1][0], dp[0][j][1] + 1);
        }
      }
      if (s[i] != '<') {
        if (j > 0) {
          ckmin(dp[1][j][1], dp[0][j][0]);
        } else {
          ckmin(dp[1][j + 1][1], dp[0][j][0]);
        }
        if (j < n) {
          ckmin(dp[1][j + 1][1], dp[0][j][1]);
        }
      }
    }
    dp[0].swap(dp[1]);
  }
  int ans = n;
  for (int j = 0; j <= n; ++j) {
    ans = std::min({ans, dp[0][j][0] - (j > 0) + j, dp[0][j][1] + j});
  }
  std::cout << n - ans << '\n';
}

int main() {
#ifndef LOCAL
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
#endif

  int t;
  std::cin >> t;
  for (int i = 0; i < t; ++i) {
    dbg(i + 1);
    solve();
    bar();
  }
}