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;
#define int long long
#define N 666666
int arr[N];
char str[N];
int s1[N],s2[N];

/*
><<>>
*/
signed main(){
	scanf("%s",str+1);
	int len=strlen(str+1)+1;

	for(int i=1;i<=len;i++){
		if(str[i-1]=='<') s1[i]=s1[i-1]+1;
		else s1[i]=0;
	}
	

	for(int i=len;i>=0;i--){
		if(str[i]=='>') s2[i]=s2[i+1]+1;
		else s2[i]=0;
	}
	int ans=0;
	for(int i=1;i<=len;i++) ans+=max(s1[i],s2[i]);
	cout<<ans;
	return 0;
}