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().split("");
		int n = s.length;
		int[] value = new int[n + 1];
		for (int i = 0 ; i < n + 1 ; i++) {
			value[i] = 0;
		}
		
		rightWrite(s, value, 0, n);
		
		for(int i = 1 ; i < n ; i++) {
			if(s[i].equals("<")) {
				leftWrite(s, value, i -1);
				i = rightWrite(s, value, i, n);
			}
		}
		
		leftWrite(s, value, n -1);
		
		long ans= 0 ;
		for (int i = 0 ; i < n + 1 ; i++ ) {
			 ans +=value[i];
		}
		System.out.println(ans);
	}

	public static int rightWrite(String s[],int[] value , int i ,int n){

		int cnt = 1;
		while(i < n && s[i] .equals("<")) {
			if(value[i + 1] < cnt ) {
				value[i + 1] = cnt;
			}
			i++;
			cnt++;
		}
		
		
		return i;
	}
	
	public static void leftWrite(String s[],int[] value , int i){

		int cnt = 1;
		while(i >= 0 && s[i].equals(">")) {
			if(value[i] < cnt ) {
				value[i] = cnt;
			}
			i--;
			cnt++;
		}
	}
	
	
}
