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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		char[] s = br.readLine().toCharArray();
		br.close();

		int n = s.length + 1;
		int[] arr = new int[n];

		for ( int i = 0; i <= n - 2; i++ ) {
			if ( s[i] == '<' ) {
				arr[i + 1] = arr[i] + 1;
			}
		}

		long ans = 0;
		for ( int i = n - 2; 0 <= i; i-- ) {

			if ( s[i] == '>' ) {

				if ( i <= 0 ) {
					arr[i] = arr[i + 1] + 1;
				} else if ( s[i - 1] == '<' ) {
					arr[i] = Math.max(arr[i], arr[i + 1] + 1);
				} else if ( s[i - 1] == '>' ) {
					arr[i] = arr[i + 1] + 1;
				}
			}

			ans += arr[i];
		}
		ans += arr[n - 1];

		System.out.println(ans);
	}
}