Contest Duration: - (local time) (150 minutes) Back to Home
A - >< /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

• S_i= < のとき： a_i<a_{i+1}
• S_i= > のとき： a_i>a_{i+1}

### 制約

• 2 \leq N \leq 5 \times 10^5
• S<> のみから成る長さ N-1 の文字列．

### 入力

S


### 入力例 1

<>>


### 出力例 1

3


a=(0,2,1,0) は良い非負整数列であり， この場合の要素の総和は 3 になります． 要素の総和が 3 より小さい良い非負整数列は存在しません．

### 入力例 2

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


### 出力例 2

28


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