Problem:
Score : 300 points

Problem Statement

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.

Sample Input 1

<>>

Sample Output 1

3

a=(0,2,1,0) is a good sequence whose sum is 3.
There is no good sequence whose sum is less than 3.

Sample Input 2

<>>><<><<<<<>>><

Sample Output 2

28

Solution in C++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define LINF 100000000000000007LL
#define ll long long
using namespace std;
int mi[114514];
signed main(){
	string s;
	cin>>s;
	int n = s.size()+1;
	for(int i=1;i<n;i++){
		if( s[i-1] == '<' ){
			mi[i] = max(mi[i],mi[i-1] + 1);
		}
	}
	for(int i=n-1;i>=1;i--){
		if( s[i] == '>'){
			mi[i] = max(mi[i],mi[i+1]+1);
		}
	}
	int ans = 0;
	for(int i=0;i<n;i++){
		ans += mi[i];
		//cout<<mi[i]<<endl;
	}
	cout<<ans<<endl;
	return 0;
}