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 re

S = raw_input()

array = []
prev = None
for i in S:
    if prev is None:
        prev = i
        duplicate_count = 1
        continue
    if prev == i:
        duplicate_count += 1
    else:
        array.append((prev, duplicate_count))
        duplicate_count = 1
    prev = i
array.append((prev, duplicate_count))

array = [(k, range(v + 1)) for k, v in array]

for i in range(len(array) - 1):
    if array[i][0] == '<' and array[i + 1][0] == '>':
        if array[i][1][-1] < array[i + 1][1][-1]:
            array[i] = array[i][0], array[i][1][:-1]
        else:
            array[i + 1] = array[i + 1][0], array[i + 1][1][:-1]
print sum(sum(v) for k, v in array)
