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>
using namespace std;
string s;
int A[5<<17];
int main()
{
	cin>>s;
	int pre=0;
	int id=0;
	while(id<s.size())
	{
		while(id<s.size()&&s[id]=='<')id++;
		int x=id;
		while(id<s.size()&&s[id]=='>')id++;
		int y=id;
		for(int i=pre;i<=x;i++)
		{
			A[i]=i-pre;
		}
		int k=0;
		for(int j=y;j>=x;j--)
		{
			A[j]=max(A[j],k);
			k++;
		}
		pre=y;
	}
	long ans=0;
	for(int i=0;i<=s.size();i++)
	{
		//cout<<A[i]<<" ";
		ans+=A[i];
	}
	//cout<<endl;
	cout<<ans<<endl;
}
