#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;
}
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |