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>
#include<algorithm>
using namespace std;
constexpr auto maxn=500005;
long long f[maxn];
int g[maxn];
int main() {
	string s;
	cin >> s;
	long long sum=0;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == '<')
			f[i + 1] = max(f[i + 1], f[i] + 1);
	}
	for (int i = s.size() - 1; i >= 0; i--) {
		if (s[i] == '>')
			f[i] = max(f[i], f[i+1] + 1);
	}
	for (int i = 0; i <= s.size(); i++) {
		sum += f[i];
	}
	return cout << sum << endl, 0;
}