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;

int main(){
	string s;
	cin>>s;
	
	long long int len;
	len=s.size();
	
long long	i=0;
	long long int lt=0,gt=0,ans=0;
	
	while(i<len){
		
		while(i<len&&s[i]=='<'){
			lt++;
			i++;
		}
		while(i<len&&s[i]=='>'){
			gt++;
			i++;
		}
		
		if(lt==0){
			ans+=(gt*(gt+1))/2;
		}
		else if(gt==0){
			ans+=(lt*(lt+1))/2;
		}
		else{
			ans+=max(gt,lt)+((gt-1)*gt)/2+((lt-1)*lt)/2;
		}
		lt=0;gt=0;
			}
	cout<<ans;
}