Example

Input

7
>>


Output

7
#include <bits/stdc++.h>
using namespace std;

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N; cin >> N;
  string S;
  cin >> S;

  VI ls(N+1), rs(N+1);
  REP(i,N)
	rs[i+1] = rs[i] + (S[i] == '>');
  for(int i=N-1;i>=0;--i)
	ls[i] = ls[i+1] + (S[i] == '<');

  int ans = 0;
  REP(i,N){
	if(rs[i+1] == ls[i]){
	  if(S[i] == '<'){
		int it = lower_bound(ALL(rs), 1) - begin(rs) - 1;
		maxi(ans, N - it);
	  }
	  else{
		int it = lower_bound(RALL(ls), 1) - ls.rbegin() - 1;
		maxi(ans, N - it);
	  }
	}
	else if(rs[i+1] > ls[i]){
	  int it = lower_bound(ALL(rs), rs[i+1]-ls[i]) - begin(rs) - 1;
	  maxi(ans, N - it);
	}
	else{
	  int it = lower_bound(RALL(ls), ls[i]-rs[i]) - ls.rbegin() - 1;
	  maxi(ans, N - it);
	}
  }
  cout << ans << endl;
  
  return 0;
}