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
import sys
data = sys.stdin.readline().replace('\n', '')

indexes = []
def csum(a):
    return (a + 1) * a / 2
prev = 0
for element in range(1, len(data)):
    if data[element - 1] == '>' and data[element] == '<':
        indexes.append((prev, element - 1))
        prev = element
indexes.append((prev, len(data) - 1))
ans = 0
for x, y in indexes:
    fnd = False
    len = y - x + 1
    for i in range(x, y):
        if data[i] == '<' and data[i + 1] == '>':
            a = i - x + 1
            b = y - i
            if a > b:
                ans += csum(a)
                ans += csum(b - 1)
            else:
                ans += csum(b)
                ans += csum(a - 1)

            fnd = True
            break
    if not fnd:
        ans += csum(len)
print ans
