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;

int main() {
	long n,i,cur;
	string s;
	cin >> s;
	n=s.size();
	vector<long> ans(n+1,0);
	for(i=0; i<n; i++){
		if(s[i]=='<'){
			ans[i+1]=ans[i]+1;
		}
	}
	
	for(i=0; i<n; i++){
		if(s[n-1-i]=='>'){
			ans[n-1-i]=max(ans[n-i]+1,ans[n-1-i]);
		}
	}
	
	cur=0;
	for(i=0; i<n+1; i++){
		cur+=ans[i];
	}
	cout << cur << endl;
	return 0;
}