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;
const int N=500500;
char s[N];
int dep[N];
int n;
int dfs(int x){
	if(dep[x]!=-1){
		return dep[x];
	}
	dep[x]=0;
	if(x-1>=0&&s[x-1]=='<'){
		dep[x]=max(dep[x],dfs(x-1)+1);
	}
	if(x<n&&s[x]=='>'){
		dep[x]=max(dep[x],dfs(x+1)+1);
	}
	return dep[x];
}
int main(){
	memset(dep,-1,sizeof(dep));
	scanf("%s",s);
	n=strlen(s);
	LL sum=0;
	for(int i=0;i<=n;i++){
		sum+=dfs(i);
	}
	cout<<sum<<endl;
	return 0;
}