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.*;
public class Main {

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		String S = stdIn.next();
		char[] s = S.toCharArray();
		int n = S.length();
		long count = 0;
		
		if(s[0] == '<') {
			for(int i = 0; i < n;) {
				long temp1 = 1;
				while(i < n-1 && s[i] == s[i+1]) {
					temp1++;
					i++;
				}
				i++;
				long temp2 = 1;
				while(i < n-1 && s[i] == s[i+1]) {
					temp2++;
					i++;
				}
				i++;
				count += temp1*(temp1-1)/2+temp2*(temp2-1)/2+Math.max(temp1,temp2);
			}
		}
		else {
			int i = 0;
			long temp = 1;
			while(i < n-1 && s[i] == s[i+1]) {
				temp++;
				i++;
			}
			i++;
			count += temp*(temp+1)/2;
			for(; i < n;) {
				long temp1 = 1;
				while(i < n-1 && s[i] == s[i+1]) {
					temp1++;
					i++;
				}
				i++;
				long temp2 = 1;
				while(i < n-1 && s[i] == s[i+1]) {
					temp2++;
					i++;
				}
				i++;
				count += temp1*(temp1-1)/2+temp2*(temp2-1)/2+Math.max(temp1,temp2);
			}
		}
		System.out.println(count);

	}

}