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 ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)

int const N = 500000;
char s[N];
int x[N];

int main(){
	scanf("%s", s);
	int n = strlen(s) + 1;
	f(i, 1, n)x[i] = s[i - 1] == '<' ? x[i - 1] + 1: 0;
	for (int i = n - 2; i >= 0; --i)if (s[i] == '>')x[i] = max(x[i], x[i + 1] + 1);
	ll an = 0;
	f(i, 0, n)an += x[i];
	printf("%lld\n", an);
}