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.*;

class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
}

class Solver {

    public void run() {
        Scanner sc = new Scanner(System.in);
        char[] S = sc.next().toCharArray();
        int N = S.length;

        int[] ans = new int[N+1];
        ans[0]=0;
        int min = 0;
        for (int i = 0; i < N; i++) {
            char ch = S[i];
            if (ch == '<') ans[i+1]=Math.max(ans[i+1], ans[i]+1);
        }

       for (int i = N - 1; i >= 0; i--) {
            char ch = S[i];
            if (ch == '>') ans[i]=Math.max(ans[i], ans[i + 1]+1);
        }

        long sum = 0;
        for (int a : ans) {
            sum += a;
        }

        System.out.println(sum);
        
        return;
    }

}