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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;

class Main{
  public static void main(String[] args){
  	Scanner sc = new Scanner(System.in);
    String line = sc.nextLine();
    
    int sum = 0;
	int l[] = new int[line.length()+1];
    int r[] = new int[line.length()+1];
    l[line.length()] = 0; r[0] = 0;
    
    for(int i = 1; i < line.length(); i++){
      if(line.charAt(i-1) == '<') l[i] = l[i-1]+1;
      else l[i] = 0;
    }
    for(int i = line.length()-1; i >= 0; i--){
      if(line.charAt(i) == '>') r[i] = r[i+1]+1;
      else r[i] = 0;
    }
      
    for(int i = 0; i < line.length(); i++) 
      sum += Math.max(l[i], r[i]);
    System.out.println(sum);

  }
}