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 {

    private static long sum(int g, int l) {
        return (long) g * (g + 1) / 2 + l * (l - 1) / 2;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        int i = 0;
        int j = 0;
        long ans = 0;
        for (int k = 0; k < s.length(); k++) {
            if ('>' == s.charAt(k)) {
                j++;
                continue;
            }
            if (j == 0) {
                i++;
                continue;
            }
            ans += sum(Math.max(i, j), Math.min(i, j));
            i = 1;
            j = 0;
        }
        ans += sum(Math.max(i, j), Math.min(i, j));
        System.out.println(ans);
    }

}
