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

        char[] S = sc.next().toCharArray();

        long ans = 0;
        int up = 0;
        int down = 0;
        for (int i = 0; i < S.length; i++) {

            if (S[i] == '<') {
                up++;
            } else {
                down++;
            }

            if (i == S.length-1 || S[i] == '>' && S[i+1] == '<') {
                if (up == down) {
                    ans += sum(up) + sum(down) - up;
                } else if (up < down) {
                    ans += sum(up-1) + sum(down);
                } else {
                    ans += sum(up) + sum(down-1);
                }
                up = 0;
                down = 0;
            }
        }
        System.out.println(ans);
    }

    private static long sum(int n) {
        return (long)n*(n+1)/2;
    }
}
