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;
	long long puncak=0;
	long long tebing=0;
	long long ans=0;
	cin>>s;
	for(long long i=0; i<s.length(); i++){
		if(s[i]=='>'){
			if(i>0 && s[i-1]=='<') tebing=0;	
			tebing++;
			if(puncak>=tebing) ans+=tebing-1;
			else ans+=tebing;
		}
		else if(s[i]=='<'){
			if(i>0 && s[i-1]=='>') puncak=0;
			puncak++;
			ans+=puncak;
		}
	}
	cout<<ans<<endl;
}