Example

Input

7
>>


Output

7
#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

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


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n; cin >> n;
	string s;
	cin >> s;
	vi l, r;
	REP(i, s.size()) {
		if (s[i] == '<')l.push_back(i);
		else r.push_back(i);
	}
	vi lcntl(n), lcntr(n), rcntl(n), rcntr(n);
	REP(i, n) {
		if (s[i] == '<') {
			lcntl[i]++;
			rcntl[i]++;
		}
		else {
			lcntr[i]++;
			rcntr[i]++;
		}
	}
	REP(i, n - 1) {
		lcntl[i + 1] += lcntl[i];
		lcntr[i + 1] += lcntr[i];
	}
	RREP(i, n - 1) {
		rcntl[i] += rcntl[i + 1];
		rcntr[i] += rcntr[i + 1];
	}
	int ans = 0;
	REP(i, n) {
		if (s[i] == '<') {
			int a = lcntr[i], b = rcntl[i];

			if (a < b) {
				int c = lower_bound(rcntl.rbegin(), rcntl.rend(), b - a ) - rcntl.rbegin();

				ans = max(ans, n - c);
			}
			else {
				int c = lower_bound(ALL(lcntr), a - b + 1) - lcntr.begin();
	
				ans = max(ans, n - c);
			}
		}
		else {
			int a = lcntr[i], b = rcntl[i];
			if (a <= b) {
				int c = lower_bound(rcntl.rbegin(), rcntl.rend(), b - a + 1) - rcntl.rbegin();

				ans = max(ans, n - c);
			}
			else {
				int c = lower_bound(ALL(lcntr), a - b ) - lcntr.begin();
	
				ans = max(ans, n - c);
			}
		}
	}
	cout << ans << endl;

}

