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.*;

public class Main{
    public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);

      String s = sc.next();
      int lng = s.length();
      char[] c = new char[lng];
      for(int i=0;i<lng;i++){
        c[i] = s.charAt(i);
      }
      int ans = 0;
      int cnt1 = 0;
      int cnt2 = 0;
      int flag = 0;
      int memo1 = 0;
      int memo2 = 0;
      for(int i=0;i<lng;i++){
///////////////////////////////////////////
        if(c[i]=='>'){
          cnt1++;
          memo2=cnt1;
          ans += cnt1;
        }
        else{
          flag=1;
          memo2 = cnt1;
          cnt1=0;
        }
        if(flag==1 || i==lng-1){
          if(memo1>=memo2){
            ans -= memo2;
            memo1=0;
            memo2=0;
            flag=0;
          }
          if(memo1<memo2){
            ans -= memo1;
            memo1=0;
            memo2=0;
            flag=0;
          }
        }
///////////////////////////////////////////
        if(c[i]=='<'){
          cnt2++;
          ans += cnt2;
          if(i!=lng-1){ // not end
            if(c[i+1]=='>'){ //<>
              memo1 = cnt2;
            }
          }
        }
        else{
          cnt2=0;
        }
///////////////////////////////////////////
      }




      System.out.println(ans);

    }
}