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 < (int)(n); i++)

int main()
{
  string S;
  long long Sum=0;
  cin >> S;
  vector<int> L(S.size()+1), R(S.size()+1);
  for(int i=1; i<S.size()+1; i++){
    if(S.at(i-1)=='>') L.at(i)=0;
    else L.at(i)=L.at(i-1)+1;
  }
  for(int i=S.size()-1; i>=0; i--){
    if(S.at(i)=='<') R.at(i)=0;
    else R.at(i)=R.at(i+1)+1;
  }
  rep(i, S.size()+1) Sum=Sum+max(L.at(i), R.at(i));
  cout << Sum << endl;
}