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;

import static java.lang.System.in;

public final class Main {
	static Scanner sc = new Scanner(in);

	public static void main(String[] args) {
		char[] S = sc.next().toCharArray();
		int N = S.length + 1;
		int[] l = new int[N];
		int[] r = new int[N];
		for (int i = 1; i < N; i++) {
			if (S[i - 1] == '<') {
				l[i] = l[i - 1] + 1;
			}
		}
		for (int i = N - 2; i >= 0; i--) {
			if (S[i] == '>') {
				r[i] = r[i + 1] + 1;
			}
		}
		long ans = 0;
		for (int i = 0; i < N; i++) {
			ans += Math.max(l[i], r[i]);
		}
		System.out.println(ans);
	}
}
