Example

Input

7
>>


Output

7
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define PB push_back

const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')';
  return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'[';
  REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}
  out<<']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  cin >> n;
  string s;
  cin >> s;

  // sum_r[i] = ([0,i]の'>'の個数)
  // sum_l[i] = ([i,n-1]の'<'の個数)
  VI sum_r(n), sum_l(n);
  sum_l[n-1] = s[n-1]=='<'; sum_r[0] = s[0]=='>';
  FOR(i, 1, n) sum_r[i] = sum_r[i-1] + (s[i]=='>');
  for(int i=n-2; i>=0; --i) sum_l[i] = sum_l[i+1] + (s[i]=='<');

  // cout << sum_r << endl << sum_l << endl;

  // pos_r[i] = (左から数えてi番目の'>'の位置)
  // pos_l[i] = (右から数えてi番目の'<'の位置)
  VI pos_r(n), pos_l(n);
  int cnt = 0;
  REP(i, n) if(s[i]=='>') pos_r[cnt++] = i;
  cnt = 0;
  for(int i=n-1; i>=0; --i) if(s[i]=='<') pos_l[cnt++] = i;

  // cout << pos_r << endl << pos_l << endl;

  int ret = 1;
  REP(i, n) {
    // [i+1,n-1]の'<'の数、[0,i-1]の'>'の数
    int lnum = i==n-1?0:sum_l[i+1], rnum = i==0?0:sum_r[i-1];
    if(s[i]=='<') {
      if(lnum>=rnum) chmax(ret, pos_l[lnum-rnum]+1);
      else chmax(ret, n-pos_r[rnum-lnum-1]);
    } else {
      if(rnum >= lnum) chmax(ret, n-pos_r[rnum-lnum]);
      else chmax(ret, pos_l[lnum-rnum-1]+1);
    }
    // cout << "i:" << i << " " << lnum << " " << rnum << " " << ret << endl;
  }
  cout << ret << endl;

  return 0;
}

