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>
using namespace std;
const int MAXN=(int)5e5+5;
char s[MAXN];
int main(){
	int len,i=1;
	long long ans=0;
	scanf("%s",s+1);
	len=strlen(s+1);
	while(i<=len){
		int sum1=0,sum2=0;
		while(s[i]^'>'&&i<=len){
			i++;
			sum1++;
		}
		while(s[i]^'<'&&i<=len){
			i++;
			sum2++;
		}
		if(sum1>sum2)
			sum1^=sum2^=sum1^=sum2;
		ans+=(1ll*sum1*(sum1-1)>>1)+(1ll*sum2*(sum2+1)>>1);
	}
	printf("%lld\n",ans);
	return 0;
}
