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<cstring>
#include<cstdio>
#include<algorithm>
#include<iostream>
#define int long long
using namespace std;
string s;
int len,sum,tt=1,maxx,ans;
signed main(){
	cin>>s;len=s.length() ;
	s+=".";
	for(register int i=1;i<s.length() ;i++){
		if(s[i]==s[i-1]){
			tt++;
		}
		else{
			if(s[i-1]=='>'){
				if(maxx>=tt) ans+=(tt-1)*tt/2;
				else ans+=(1+tt)*tt/2,ans-=maxx;
			}
			else{
				ans+=(1+tt)*tt/2;maxx=tt;
			}
			tt=1;
		}
	}
	cout<<ans<<endl;
}