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 PyPy3 (2.4.0) (judge verdict: Runtime Error)

s = input()

def rle(s):
	tmp, count, ans = s[0], 1, ""
	for i in range(1,len(s)):
		if tmp == s[i]:
			count += 1
		else:
			ans += tmp + str(count)
			tmp = s[i]
			count = 1
	ans += tmp + str(count)
	return ans

r = rle(s)

if (len(r) // 2) % 2 == 1:
	r += '>0'

res = 0
for i in range(len(r) // 4):
	a, b = int(r[4*i+1]), int(r[4*i+3])
	ma, mi = max(a, b), min(a, b)
	res += (ma * (ma + 1)) // 2 + (mi * (mi - 1)) // 2
print(res)