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
// A - ><
#include <bits/stdc++.h>

using namespace std;

int main(int argc, char *argv[])
{
	string s;
	cin >> s;

	long long ans = 0;
	for (int i = 0; i < s.size(); ) {
		long long n1 = 0, n2 = 0;
		for ( ; i < s.size() && s[i] == '<'; i++) n1++;
		for ( ; i < s.size() && s[i] == '>'; i++) n2++;
		ans += max(n1, n2);
		if (n1 > 0) ans += (n1 - 1 + 1) * (n1 - 1) / 2;
		if (n2 > 0) ans += (n2 - 1 + 1) * (n2 - 1) / 2;
	}
	cout << ans << endl;
	return 0;
}
