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;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
 char n[500001];
  cin>>n;
  int y=strlen(n);
  int a[500010]={};
  
  
  rep(i,y)if(n[i]=='<')a[i+1]=max(a[i]+1,a[i+1]);
  
  for(int k=y-1;k>=0;k--)if(n[k]=='>')a[k]=max(a[k+1]+1,a[k]);
  
  long long res=0;
  rep(i,y+1)res+=a[i];
  cout<< res<<endl;
  
}
  