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.PrintWriter;
import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        sc.close();

        long left[] = new long[S.length()+1];
        long right[] = new long[S.length()+1];

        int c = 0;
        for (int i=0; i<S.length(); i++) {
            if ("<".equals(S.substring(i, i+1))) {
                left[i] = c;
                left[i+1] = c+1;
                c++;
            } else {
                c = 0;
            }
        }
        c = 0;
        for (int i=S.length()-1; i>=0; i--) {
            if (">".equals(S.substring(i, i+1))) {
                right[i] = c+1;
                right[i+1] = c;
                c++;
            } else {
                c = 0;
            }
        }
        for (int i=0; i<S.length(); i++) {
            if (left[i]<right[i])
                left[i] = right[i];
        }
        

        long sum = Arrays.stream(left).sum();
        PrintWriter out = new PrintWriter(System.out);
        out.println(sum);
        out.flush();
    }
}