Given is a string S of length N-1. Each character in S is `<` or `>`.

A sequence of N non-negative integers, a_1,a_2,\cdots,a_N, is said to be good when the following condition is satisfied for all i (1 \leq i \leq N-1):

* If S_i= `<`: a_i<a_{i+1}
* If S_i= `>`: a_i>a_{i+1}



Find the minimum possible sum of the elements of a good sequence of N non-negative integers.

Constraints

* 2 \leq N \leq 5 \times 10^5
* S is a string of length N-1 consisting of `<` and `>`.

Input

Input is given from Standard Input in the following format:


S


Output

Find the minimum possible sum of the elements of a good sequence of N non-negative integers.

Examples

Input

<>>


Output

3


Input

<>>><<><<<<<>>><


Output

28
#include<cstdio>
#include<algorithm>
using namespace std;
char p[501000];
int n, L[501000], R[501000];
long long res;
int main() {
	int i;
	scanf("%s", p);
	for (i = 0; p[i]; i++);
	n = i;
	for (i = 0; i <= n; i++) {
		if (i != 0 && p[i - 1] == '<')L[i] = L[i - 1] + 1;
	}
	for (i = n; i >= 0; i--) {
		if (i != n && p[i] == '>')R[i] = R[i + 1] + 1;
		res += max(L[i], R[i]);
	}
	printf("%lld\n", res);

}