#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= x; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
using namespace std;
#define DUMPOUT cerr
// vector
template < typename T > istream &operator>>(istream &is, vector< T > &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}
// pair
template < typename T, typename U >
ostream &operator<<(ostream &os, pair< T, U > &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
// vector
template < typename T >
ostream &operator<<(ostream &os, const vector< T > &vec) {
  os << "{";
  REP(i, (int)vec.size())
  os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
  os << "}";
  return os;
}
// map
template < typename T, typename U >
ostream &operator<<(ostream &os, map< T, U > &map_var) {
  os << "{";
  FORA(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end())
      os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
// set
template < typename T > ostream &operator<<(ostream &os, set< T > &set_var) {
  os << "{";
  FORA(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end())
      os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
void dump_func() { DUMPOUT << endl; }
template < class Head, class... Tail >
void dump_func(Head &&head, Tail &&... tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) > 0)
    DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define DUMP(...)                                                              \
  DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                              \
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl  \
          << "    ",                                                           \
      dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define DUMP(...)
#endif

#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair< int, int >
#define ld long double
using namespace std;
template < class T > bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template < class T > bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template < class T > using vec = std::vector< T >;
template < class T > void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF = 1061109567, INF2 = INF * INF;
const double EPS = 1e-10, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
#define MAXN
//----//

vector< pair< char, int > > Runlen(string S) {
  vector< pair< char, int > > b;
  int N = S.size();
  if (N == 0)
    return b;
  char cur = S[0];
  int cnt = 1;
  for (int i = 1; i <= N - 1; i++) {
    if (cur != S[i]) {
      b.push_back(make_pair(cur, cnt));
      cnt = 1;
      cur = S[i];
    } else {
      cnt++;
    }
  }
  b.push_back(make_pair(cur, cnt));
  return b;
}
signed main() {
  cin.tie(0), ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  string S;
  cin >> S;
  S = "<" + S + ">";
  vec< pair< char, int > > x;
  DUMP(S);
  x = Runlen(S);
  vec< int > ans;
  FORA(e, x) {
    ans.pb(e.snd); // DUMP(e.fst, e.snd);
  }
  ans[0] -= 1;
  ans[ans.size() - 1] -= 1;
  int sizeA = ans.size();
  // REP(i, sizeA) { cout << ans[i] << " "; }
  int val = 0;
  REP(i, sizeA / 2) {
    int a0 = min(ans[2 * i], ans[2 * i + 1]) - 1;
    int a1 = max(ans[2 * i], ans[2 * i + 1]);
    if (a0 == -1)
      a0 = 0;
    val += a1 * (a1 + 1) / 2;
    val += a0 * (a0 + 1) / 2;
  }
  print(val);

}

Measured memory_bytes: 8640