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);
		char[] ch = sc.next().toCharArray();
		sc.close();

		int len = ch.length+1;
		int[] L = new int[len];
		int[] R = new int[len];
		for(int i = 1;i < len;i++) {
			if(ch[i-1]=='<') {
				L[i] = L[i-1] + 1;
			}
		}
		for(int i = len-2;i >= 0;i--) {
			if(ch[i]=='>') {
				R[i] = R[i+1] + 1;
			}
		}
		//System.out.println(Arrays.toString(L));
		//System.out.println(Arrays.toString(R));;
		long ans = 0;
		for(int i = 0;i < len;i++) {
			ans += Math.max(L[i], R[i]);
		}
		System.out.println(ans);
	}
}