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.io.*;
import java.util.*;
import java.math.*;
     
public class Main {
	//static int dir[][]={{0,1},{0,-1},{1,0},{-1,0}};
	public static void main(String[] args) throws Exception {
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            OutputStream outputStream = System.out;
        	PrintWriter out = new PrintWriter(outputStream);
     
            int i, j, u=0, v=0;
      String str=br.readLine();
      long sum=0, k=0, prev=0, c=0;
      for(i=0;i<str.length();i++)
      {
        char ch = str.charAt(i);
        if(ch=='<')
        {
          if(k!=0)
          {
            if(k>c)
            {
              sum+=(k*(k+1)/2);
              if(c!=0)
              	c--;
              sum+=(c*(c+1)/2);
            }
            else
            {
              k--;
				sum+=(k*(k+1)/2);
              sum+=(c*(c+1)/2);
            }
            c=0;
            k=0;
          }
          c++;
        }
        else
        {
          k++;
        }
      }
      if(c!=0)
      {
        if(k>c)
            {
              sum+=(k*(k+1)/2);
              c--;
              sum+=(c*(c+1)/2);
            }
            else
            {
              if(k!=0)
              	k--;
				sum+=(k*(k+1)/2);
              sum+=(c*(c+1)/2);
            }
        c=0;
            k=0;
      }
      if(k!=0)
      {
        if(k>c)
            {
              sum+=(k*(k+1)/2);
          	if(c!=0)
              c--;
              sum+=(c*(c+1)/2);
            }
            else
            {
              if(k!=0)
              	k--;
				sum+=(k*(k+1)/2);
              sum+=(c*(c+1)/2);
            }
      }
      out.print(sum);
    	out.flush();
    	out.close();
    	}
    }