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 {
    static Scanner sc = new Scanner(System.in);


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