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>
using namespace std;
const int N=5e5+2;
int lef[N],rig[N];
signed main(){
	int n,i,j,k,l,cnt=0;
	long long ans=0;
	string s;
	cin>>s;
	for(i=0;i<s.size();i++){
		if(s[i]=='<'){
			cnt++;
		}
		else{
			cnt=0;
		}
		lef[i+1]=cnt;
	}
	cnt=0;
	for(i=s.size()-1;i>-1;i--){
		if(s[i]=='>'){
			cnt++;
		}
		else{
			cnt=0;
		}
		rig[i]=cnt;
	}
	for(i=0;i<=s.size();i++){
		ans+=max(lef[i],rig[i]);
	}
	cout<<ans;
}