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>
char S[1001000];
int minn[1001000];
long long ans,n;
int main(){
	scanf("%s",S+1);
	n=strlen(S+1);
	minn[0]=0;
	for(int i=1;i<=n;i++)
		if(S[i]=='>')minn[i]=0;
		else minn[i]=minn[i-1]+1;
	
	int now=minn[n];
	ans=now;
	for(int i=n-1;i>=0;i--){
		if(S[i+1]=='>')now=std::max(now+1,minn[i]);
		else now=minn[i];
		ans+=now;
	}
	printf("%lld\n",ans);
}