#include "bits/stdc++.h"
 
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;

typedef vector<LL> VLL;
 
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define SIZE(a) int((a).size())
 
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int INT_LARGE = 1000000100;
 
 
//debug func
template<typename T>
void vecprint(vector<T> v) {
    for(auto x : v) {
        cerr << x << " ";
    }
    cerr << endl;
}
 
template<typename T>
void vecvecprint(vector<vector<T>> v) {
    for(auto x :v) {
        REP(i, x.size()-1) {
            cerr << x[i] << " ";
        }
        cerr << x[x.size()-1] <<endl;
    }
}
 
template<typename T>
void pqprint(priority_queue<T> q) {
    while(!q.empty()) {
        cerr << q.top() << " ";
        q.pop();
    }
    cerr << endl;
}
 
template<typename T>
void qprint(queue<T> q) {
    while(!q.empty()) {
        cerr << q.front() << " ";
        q.pop();
    }
    cerr << endl;
}
 
template<typename T>
void vecqprint(vector<queue<T>> v) {
    for(int i = 0; i < v.size(); i++) {
        qprint(v[i]);
    }
}
 
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k, const Iterator last)
{
   /* Credits: Thomas Draper */
   if ((first == last) || (first == k) || (last == k))
      return false;
   Iterator itr1 = first;
   Iterator itr2 = last;
   ++itr1;
   if (last == itr1)
      return false;
   itr1 = last;
   --itr1;
   itr1 = k;
   --itr2;
   while (first != itr1)
   {
      if (*--itr1 < *itr2)
      {
         Iterator j = k;
         while (!(*itr1 < *j)) ++j;
         iter_swap(itr1,j);
         ++itr1;
         ++j;
         itr2 = k;
         rotate(itr1,j,last);
         while (last != j)
         {
            ++j;
            ++itr2;
         }
         rotate(k,itr2,last);
         return true;
      }
   }
   rotate(first,k,last);
   return false;
}
 
int main(void) {
    string s;
    cin >> s;
    VI vext;
    vector<bool> vbotflg;
    vext.push_back(0);
    vbotflg.push_back(s[0] == '<');
    REP(i, SIZE(s)) {
        if(s[i] == '<' && s[i+1] == '>') {
            vext.push_back(i+1);
            vbotflg.push_back(false);
        }
        if(s[i] == '>' && s[i+1] == '<') {
            vext.push_back(i+1);
            vbotflg.push_back(true);
        }
    }
    vext.push_back(SIZE(s));
    vbotflg.push_back(s[SIZE(s)-1] == '>');
    // vecprint(vext);
    // vecprint(vbotflg);
    
    VLL vs(SIZE(s)+1, 0);
    REP(i, SIZE(vext)) {
        if(!vbotflg[i]) continue;
        int bottom = vext[i];
        int ltop, rtop;
        ltop = i < 1 ? 0 : vext[i-1];
        rtop = i > (SIZE(vext)-2) ? SIZE(s) : vext[i+1];
        vs[ltop] = max(vs[ltop], (LL)(bottom - ltop));
        for(int i = bottom; i > ltop; i--) {
            int depth = bottom - i;
            vs[i] = depth;
        }
        FOR(i, bottom, rtop+1) {
            int depth = i - bottom;
            vs[i] = depth;
        }
    }
    // vecprint(vs);
    LL res = 0;
    for(LL x : vs) res += x;
    cout << res << endl;
}

Measured memory_bytes: 5884