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 <iostream>
using namespace std;

int main(){
	string s;
	long long res, pl, pr;
	cin >> s;

	res = 0;
	pl = 0;
	pr = 0;
	for(int i=0; i<s.length(); i++){
		if(s[i] == '<'){
			if(pr > 0){
				res += max(pl, pr);
				pl = 0;
				pr = 0;
			}
			res += pl;
			pl++;
			if(i == s.length()-1){
				res += pl;
			}
		}else{
			res += pr;
			pr++;
			if(i == s.length()-1){
				res += max(pl, pr);
			}
		}
	}
	cout << res << endl;
	return 0;


}