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) throws Exception {
		Scanner sc = new Scanner(System.in);
		String[] input = sc.next().split("");
		long numR = 0;
		long numL = 0;
		long res = 0;
		for (int i = 0; i < input.length - 1; i++) {
			if (input[i].equals("<")) {
				res += numL;
				numL++;
			} else {
				res += numR;
				numR++;
				if (input[i + 1].equals("<")) {
					res += Math.max(numL, numR);
					numL = 0;
					numR = 0;
				}
			}
		}
		if (input[input.length - 1].equals("<")) {
			res += numL;
			numL++;
			res += numL;
		} else {
			res += numR;
			numR++;
			res += Math.max(numL, numR);
		}
		System.out.println(res);
	}
}
