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 <cstring>
#include <algorithm>

typedef long long LL;
const int MN = 500005;

int N, a[MN], b[MN];
char s[MN];
LL Ans;

int main() {
	scanf("%s", s + 1), N = strlen(s + 1) + 1;
	a[1] = 0, b[N] = 0;
	for (int i = 2; i <= N; ++i) a[i] = s[i - 1] == '<' ? a[i - 1] + 1 : 0;
	for (int i = N - 1; i >= 1; --i) b[i] = s[i] == '>' ? b[i + 1] + 1 : 0;
	for (int i = 1; i <= N; ++i) Ans += std::max(a[i], b[i]);
	printf("%lld\n", Ans);
	return 0;
}