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 Ruby (2.3.3) (judge verdict: Accepted)

s = gets.chomp.split("")

left_streak = [0]
current_left_streak = 0
s.each do |c|
  current_left_streak = c == "<" ? current_left_streak + 1 : 0
  left_streak << current_left_streak
end

right_streak = [0]
current_right_streak = 0
s.reverse.each do |c|
  current_right_streak = c == ">" ? current_right_streak + 1 : 0
  right_streak.unshift(current_right_streak)
end

nums = []
(s.size + 1).times { |i| nums << [left_streak[i], right_streak[i]].max }

puts nums.inject(:+)