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<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=5e5+4;
char ss[N];
int a[N],b[N],n;
ll sum;
int main() {
	scanf("%s",ss+1);
	n=strlen(ss+1)+1;
	for (register int i=2;i<=n;++i)
		if (ss[i-1]=='<')
			a[i]=a[i-1]+1;
	for (register int i=n-1;i;--i)
		if (ss[i]=='>')
			b[i]=b[i+1]+1;
	for (register int i=1;i<=n;++i)
		sum+=max(a[i],b[i]);
	printf("%lld\n",sum);
	return 0;
}