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.io.*;
import java.math.*;
 
public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        char[] s = sc.next().toCharArray();
        int[] li = new int[s.length];
        long ans = 0;
        int chainDec = 0;
        int now = 0;
        int i = 0;
        for(char c : s){
            if(c == '<'){
                now++;
                ans += now;
                chainDec = 0;
            }else{
                chainDec++;
                if(now > 0){
                    li[i-1] = now;  
                    now = 0;
                }else{
                    if(i-chainDec >= 0 && li[i-chainDec] >= chainDec){
                        ans += chainDec-1;
                    }else{
                        ans += chainDec;
                    }
                }
            }
            i++;
        }
        System.out.println(ans);
    }
}