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<iostream>
#include<string>
using namespace std;
int main(){
	long long sum=0,now=0;
	long long ya=0,nowYa=0;
	string S;
	cin>>S;
	S[S.length()]='<';
	for(long long i=0;i<S.length();i++){
		if(S[i]=='<' && S[i+1]=='>'){
			now=now+1;
			sum+=now;
			ya=i+1;
			nowYa=now;
		}else if(S[i]=='>'){
			now=now-1;
			if(now==-1)sum+=i-ya;
			if(nowYa<=i-ya){sum++;nowYa++;}
			now=0;
		}else if(S[i]=='<'&&S[i+1]=='<'){
			now=now+1;
			sum+=now;
		}
	}
	cout<<sum;
	return 0;
}