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>
typedef long long int ll;
using namespace std;

int main(){
  string s;cin>>s;
  char c='<';ll num=0LL;
  vector<ll> count;
  for(int i=0;i<s.size();i++){
  	if(s[i]!=c){
      count.push_back(num);
      num=1LL;
    }else{
      num++;
    }
    c=s[i];
  }
  count.push_back(num);
  ll ans=0;
  for(int i=0;i+1<count.size();i+=2)ans-=min(count[i], count[i+1]);
  for(auto &e: count){
  	ans+=(e+1)*e/2;
  }
  cout<<ans<<endl;
  return 0;
}