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>
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define ll long long

using namespace std;

const int N=5e5+10;
int n,v[N]; char s[N]; ll ans;

int main(){
	scanf("%s",s+1); n=strlen(s+1)+1;
	s[0]='>'; s[n]='<';
	rep (i,1,n) if (s[i-1]=='>'&&s[i]=='<'){
		v[i]=0;
		for (int j=i-1;j>=1&&s[j]=='>';j--) v[j]=max(v[j],v[j+1]+1);
		for (int j=i+1;j<=n&&s[j-1]=='<';j++) v[j]=max(v[j],v[j-1]+1);
	}
	rep (i,1,n) ans+=v[i];
	printf("%lld\n",ans);
	return 0;
}