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[] $) throws Exception{
		Scanner s=new Scanner(System.in);
		String c='>'+s.next()+'<';
		int n=c.length()-1;

		long[]a=new long[n];
		Arrays.fill(a,-1);
		for(int i=0;i<n;++i)
			if(c.substring(i,i+2).equals("><"))
				a[i]=0;
		for(int i=1;i<n;++i)
			if(c.charAt(i)=='<')
				a[i]=a[i-1]+1;
		for(int i=n-2;i>=0;--i)
			if(c.charAt(i+1)=='>')
				a[i]=Math.max(a[i],a[i+1]+1);
		System.out.println(Arrays.stream(a).sum());
	}
}
