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.*;
public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String s = sc.next();
    int n = s.length();
    int[] leastnums = new int[n + 1];
    for (int i = 0; i < n; i++) {
      if (s.charAt(i) == '<') {
        leastnums[i + 1] = leastnums[i] + 1;
      }
    }
    for (int j = 0; j < n; j++) {
      if (s.charAt(n - 1 - j) == '>' && leastnums[n - 1 - j] <= leastnums[n - j]) {
        leastnums[n - 1 - j] = leastnums[n - j] + 1;
      }
    }
    long count = 0;
    for (int i : leastnums) {
      count += i;
    }
    System.out.println(count);
  }
}
