#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144*2LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(20);
}
#define int ll
int visited[200000];
string s;
pair<int, int> calc(int now) {
	int now_l = now - 1;
	int now_r = now + 1;
	int cnt = 0;
	while (now >= 0 && now < s.length()) {
		if (s[now] == '>') {
			now = now_r;
			now_r++;
		}
		else if(s[now] == '<') {
			now = now_l;
			now_l--;
		}
		cnt++;
	}
	if (now < 0) {
		return mp(1, cnt);
	}
	else {
		return mp(0, cnt);
	}
}
void solve(){
	int n;
	cin >> n >> s;
	int bot = -1;
	int top = s.length();
	while (top - bot > 1) {
		int mid = (top + bot) / 2LL;
		if (calc(mid).first == 1) {
			bot = mid;
		}
		else {
			top = mid;
		}
	}
	cout << max(calc(bot).second, calc(bot + 1).second) << endl;
}

#undef int
int main() {
	init();
	solve();
}
