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
#include<bits/stdc++.h>
using namespace std;

int main()
{
  string S;cin>>S;
  int count1,count2,i;long long ans=0;
  for(i=0;i<(int)S.size();)
  {
    count1=0,count2=0;
    while(S[i]=='<'){i++;count1++;}
    while(S[i]=='>'){i++;count2++;}
    for(int j=max(count1,count2);j>-1;j--)ans+=j;
    for(int j=min(count1,count2)-1;j>-1;j--)ans+=j;
  }
  printf("%lld",ans);
}