https://codeforces.com/contest/1140/problem/B

题解：

如果最左边是>或者最右边是<那么ans为0；

否则，求最左边开始<的数量和最右边>的数量其中较小的一个作为ans。

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp,sum;
int a[N];
char str[N];
struct node{};
char str1[N];
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        scanf("%s",str);
        str1[0]=str[0];
        cnt=0;
        for(int i=1;i<n;i++){
            if(str[i-1]!=str[i]){
                str1[++cnt]=str[i];
            }
        }
        if(str1[0]=='>'||str1[cnt]=='<'){
            cout<<0<<endl;
        }else{
            temp=0;
            for(int i=0;i<n;i++){
                if(str[i]=='<'){
                    temp++;
                }else{
                    break;
                }
            }
            ans=temp;
            temp=0;
            for(int i=n-1;i>=0;i--){
                if(str[i]=='>'){
                    temp++;
                }else{
                    break;
                }
            }
            cout<<min(ans,temp)<<endl;
        }
    }

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}