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{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    String s=sc.next();
    long countl=0,countr=0;
    long sum=0;
    for(int i=0;i<s.length();i++) {
    	if(s.substring(i, i+1).equals("<")) {
    		countl++;
    		if(i!=s.length()-1&&s.substring(i+1, i+2).equals(">")) {
    			
    		}else {
    			sum+=countl;
    		}
    	}else {
    		countr++;
    		if(i!=s.length()-1&&s.substring(i+1, i+2).equals("<")) {
    			if(countr>=countl) {
    				sum+=countr*(countr+1)/2;
    			}else {
    				sum+=countl;
    				sum+=countr*(countr-1)/2;
    			}
    			countl=0;
    			countr=0;
    		}else {

    		}
    	}
    	//System.out.print(sum);
    }
    //System.out.println();
    if(s.substring(s.length()-1, s.length()).equals(">")) {
		if(countr>=countl) {
			sum+=countr*(countr+1)/2;
		}else {
			sum+=countl;
			sum+=countr*(countr-1)/2;
		}
    }else {
    	//sum+=countl;
    }
    //System.out.println(sum+" "+countl+" "+countr);
    System.out.println(sum);
  }
}