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

public class Main {

     static Scanner scanner;

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

         String S=gs();
         long[] a=new long[S.length()+1];

         long tmp=0;
    	 for(int i=0; i<S.length();i++) {
    		 char c=S.charAt(i);
    		 if(c=='<') {
    			 a[i]=tmp;
    			 a[i+1]=tmp+1;
    			 tmp++;
    		 } else {
    			 tmp=0;
    		 }
    	 }

    	 tmp=0;
    	 for(int i=S.length()-1; i>=0;i--) {
    		 char c=S.charAt(i);
    		 if(c=='>') {
    			 a[i+1]=Math.max(a[i+1], tmp);
    			 a[i]=Math.max(a[i], tmp+1);
    			 tmp++;
    		 } else {
    			 tmp=0;
    		 }
    	 }
    	 long ans=0;
    	 for(int i=0; i<S.length()+1;i++) {
    		 ans+=a[i];
    	 }
         System.out.println(ans);
     }


     // 文字列として入力を取得
     public static String gs() {
          return scanner.next();
     }

     // intとして入力を取得
     public static int gi() {
          return Integer.parseInt(scanner.next());
     }

     // longとして入力を取得
     public static long gl() {
          return Long.parseLong(scanner.next());
     }

     // doubleとして入力を取得
     public static double gd() {
          return Double.parseDouble(scanner.next());
     }
}