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

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        Long r = 0l;
        Long l = 0l;
        Long res = 0l;
        for(int i = 0;i < S.length();i++){
            if(S.charAt(i) == '<'){
                if(l > 0l){
                    if(r > l){
                        res = res + ((r * (r + 1)) + (l * (l - 1))) / 2;
                    }else{
                        if(r != 0l){
                            res = res + ((r * (r - 1)) + (l * (l + 1))) / 2;
                        }else{
                            res = res + (l * (l + 1)) / 2;
                        }
                    }
                    r = 0l;
                    l = 0l;
                }
                r++;
            }else{
                l++;
            }
        }
        if(r > 0l || l > 0l){
            if(r > 0l && l > 0l){
                if(r > l){
                    res = res + ((r * (r + 1)) + (l * (l - 1))) / 2;
                }else{
                    res = res + ((r * (r - 1)) + (l * (l + 1))) / 2;
                }
            }else if(r > 0l){
                res = res + (r * (r + 1)) / 2;
            }else{
                res = res + (l * (l + 1)) / 2;
            }
        }
        
        System.out.println(res);
    }
}
