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

public class Main { 
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
		String s=sc.next();
        ArrayList<String> a=new ArrayList<String>();
       int n=s.length();
       for(int i=0;i<n;i++){
        	a.add(String.valueOf(s.charAt(i)));
       } 
      
      //ArrayList<Long> num=new ArrayList<Long>();
      int[] num=new int[n+1];
      for (int i=0;i<n;i++){
        if(i==0){
        	if(a.get(0).equals("<")){
              num[0]=0;
            }else{
            	continue;
            }
        }else if(a.get(i-1).equals(">")&&a.get(i).equals("<")){	//><
        	num[i]=0;
            int j=i-1;
        	while(j>=0&& a.get(j).equals(">") ){	//  >が続く限り増加
               	num[j]=Math.max(num[j+1]+1,num[j]);
               	j--;
        	}
        }else if(a.get(i).equals("<")){	//<<
        	num[i]=num[i-1]+1;
        }else if(a.get(i-1).equals("<") && a.get(i).equals(">")){		//<>
        	num[i]=num[i-1]+1;
        }   
      }
      
          	if(a.get(n-1).equals("<")){
              	num[n]=num[n-1]+1;
            }else{
            	num[n]=0;
                int j=n-1;
        	    while(j>=0&& a.get(j).equals(">") ){	//  >が続く限り増加
               		num[j]=Math.max(num[j+1]+1,num[j]);
               		j--;
        		}
            }
        
      long o=0;
      for (int i=0;i<n+1;i++){
          //System.out.println(num[i]);
          o+=num[i];
      }
      System.out.println(o);
    }  
}