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;

typedef long long ll;

int dp[500005] = {};

int main(){
  string s;
  cin>>s;
  for (int i=s.size()-1;i>=0;i--) {
    dp[i] = (s[i] == '<' ? 0 : dp[i+1]+1);
  }
  ll ans = 0;
  int cur = dp[0];
  for (int i=0;i<=s.size();i++) {
    ans += cur;
    if (i==s.size()) break;
    if (s[i] == '<') {
      cur = max(cur + 1, dp[i+1]);
    } else {
      cur = dp[i+1];
    }
  }
  cout << ans << endl;
  


  return 0;
}
