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;
typedef long long ll;
int main() {
	string s;
	cin>>s;
	int n=s.size()+1;
	int x=0;
	ll res=0;
	for(int i=0;i<s.size();++i){
		int j=i;
		while(s[j]==s[i])
			++j;
		ll cnt=j-i;
		if(s[i]=='<'){
			res+=cnt*x+cnt*(cnt+1)/2;
			x=cnt;
		}else{
			res+=cnt*(cnt-1)/2;
			if(x<=cnt-1)
				res+=cnt-x;
			x=0;
		}
		i=j-1;
	}
	cout<<res<<endl;
	return 0;
}