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
S=input()
N=len(S)+1
A=[0]*N
B=[0]*N
for i in range(1,N):
  if S[i-1]=="<":
    A[i]=A[i-1]+1
for i in range(N-1)[::-1]:
  if S[i]==">":
    B[i]=B[i+1]+1
ans=[max(A[i],B[i]) for i in range(N)]
print(sum(ans))