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.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner std = new Scanner(System.in);
        String text = std.next();
        long[] dp = new long[text.length() + 1];
        for (int i = 0; i < text.length(); i++) {
            char c = text.charAt(i);
            if (c == '<') {
                dp[i + 1] = Math.max(dp[i + 1], dp[i] + 1);
            } else if (c == '>') {
                long value = Math.max(dp[i] - 1, 0);
                dp[i + 1] = Math.min(dp[i + 1], value);
            }
        }

        for (int i = text.length() - 1; i >= 0 ; i--) {
            char c = text.charAt(i);
            if (c == '<') {
                long value = Math.max(dp[i + 1] - 1, 0);
                dp[i] = Math.min(dp[i], value);
            } else if (c == '>') {
                long value = Math.max(dp[i + 1] + 1, 0);
                dp[i] = Math.max(dp[i], value);
            }
        }

        System.out.println(Arrays.stream(dp).sum());
    }
}
