#include <bits/stdc++.h>
using namespace std;
const int MAX_ARRAY = 1000000;
// #define MULTIPLE 1
void solve() {
int n, m;
std::string str;
cin >> n;
cin >> str;
int ans = 0;
for (int i = 0; i < n && str[i] == '<'; i++) {
++ans;
}
for (int i = n - 1; i >= 0 && str[i] == '>'; i--) {
++ans;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
cout.tie(nullptr);
int tests{1};
#ifdef MULTIPLE
cin >> tests;
#endif
while (tests--) {
solve();
}
return 0;
}
383. Ransom Note | 242. Valid Anagram |
141. Linked List Cycle | 21. Merge Two Sorted Lists |
203. Remove Linked List Elements | 733. Flood Fill |
206. Reverse Linked List | 83. Remove Duplicates from Sorted List |
116. Populating Next Right Pointers in Each Node | 145. Binary Tree Postorder Traversal |
94. Binary Tree Inorder Traversal | 101. Symmetric Tree |
77. Combinations | 46. Permutations |
226. Invert Binary Tree | 112. Path Sum |
1556A - A Variety of Operations | 136. Single Number |
169. Majority Element | 119. Pascal's Triangle II |
409. Longest Palindrome | 1574A - Regular Bracket Sequences |
1574B - Combinatorics Homework | 1567A - Domino Disaster |
1593A - Elections | 1607A - Linear Keyboard |
EQUALCOIN Equal Coins | XOREQN Xor Equation |
MAKEPAL Weird Palindrome Making | HILLSEQ Hill Sequence |