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<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=5e5+10;
char s[N];
ll ans;
int main(){
	scanf("%s",s+1);
	int n=strlen(s+1);
	int x=0,sum=1; ans=0;
	for (int i=2;i<=n;i++) if (s[i]!=s[i-1]) {
		if (s[i-1]=='<') x=sum,ans+=1ll*(1+sum)*sum/2; else ans+=1ll*(1+sum)*sum/2-(ll)min(sum,x),x=0; 
		sum=1;
	} else sum++;
	if (s[n]=='<') x=sum,ans+=1ll*(1+sum)*sum/2; else ans+=1ll*(1+sum)*sum/2-(ll)min(sum,x),x=0;
	printf("%lld\n",ans); 
}