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
import java.util.*;

class Main{
  public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    String s=sc.next();
    int n=s.length()+1;
    long[] d=new long[n];
    long[] p=new long[n];
    d[0]=0;
    p[n-1]=0;
    for(int i=1;i<n;i++){
      if(s.charAt(i-1)=='<'){
        d[i]=d[i-1]+1;
      }else{
        d[i]=0;
      }
    }
    for(int i=n-2;i>=0;i--){
      if(s.charAt(i)=='>'){
        p[i]=p[i+1]+1;
      }else{
        p[i]=0;
      }
    }
    long sum=0;
    for(int i=0;i<n;i++){
      sum+=Math.max(d[i],p[i]);
    }
    System.out.println(sum);
  }
}