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;
using ll = long long;

const int MAX_N = 5e6+10;
string s;
int le[MAX_N], ri[MAX_N];

void solve()
{
	const int n = s.length();
	for(int i=0;i<n;++i){
		if(s[i] == '<') le[i+1]=max(le[i+1], le[i]+1);
		else le[i+1] = 0;
	}
	for(int i=n-1;i>=0;--i){
		if(s[i] == '>') ri[i]=max(ri[i],ri[i+1]+1);
		else ri[i] = 0;
	}
	ll ans = 0;
	for(int i=0;i<=n;++i) ans+=max(le[i],ri[i]);
	cout<<ans;
}

int main()
{
	cin >> s;
	solve();
	return 0;
}