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;
char c[500010];
int now;
int main(){
	scanf("%s",c+1);int n=strlen(c+1);ll ans=0;
	for(int i=1;i<=n;){
		int j=i;
		while(c[j]==c[i]&&j<=n)j++;
		if(c[i]=='>'){
			int gnow=j-i;
			ans+=1ll*now*(now+1)/2+1ll*gnow*(gnow+1)/2;
			ans-=min(now,gnow);
			now=0;
		}
		else now=j-i;
		i=j;
	}
	if(now)ans+=1ll*now*(now+1)/2;
	cout<<ans;
	return 0;
}
