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 {
    public static void debug(String str) {
        System.out.println(str);
    }

    public static void main(String[] args) {

        String S;

        try (Scanner sc = new Scanner(System.in)) {
            S = sc.next();
        }
        char[] cArr = S.toCharArray();
        long[] down = new long[S.length() + 1];
        long[] up = new long[S.length() + 1];
        long[] ans = new long[S.length() + 1];

        long temp = 0;
        for (int i = S.length()-1; i >= 0; i--) {
            if(cArr[i] == '>'){
                temp ++;
            }else{
                temp = 0;
            }
            down[i] = temp;
        }
        temp = 0;
        for (int i = 1; i <= S.length(); i++) {
            if(cArr[i-1] == '<'){
                temp ++;
            }else{
                temp = 0;
            }
            up[i] = temp;
        }

        for (int i = 0; i < S.length()+1; i++) {
            ans[i] = Math.max(up[i], down[i]);
        }

        long result = 0;
        for(long l : ans){
            result += l;
        }

        //System.out.println(Arrays.toString(up));
        //System.out.println(Arrays.toString(down));
        //System.out.println(Arrays.toString(ans));
        System.out.println(result);

    }

}
