// #pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

// hloya template v26
 
// ░░░░░░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░░░░░
// ░░░░░░█░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░█░░░░░
// ░░░░░░█░█░▀░░░░░▀░░▀░░░░█░█░░░░░
// ░░░░░░█░█░░░░░░░░▄▀▀▄░▀░█░█▄▀▀▄░
// █▀▀█▄░█░█░░▀░░░░░█░░░▀▄▄█▄▀░░░█░
// ▀▄▄░▀██░█▄░▀░░░▄▄▀░░░░░░░░░░░░▀▄
// ░░▀█▄▄█░█░░░░▄░░█░░░▄█░░░▄░▄█░░█
// ░░░░░▀█░▀▄▀░░░░░█░██░▄░░▄░░▄░███
// ░░░░░▄█▄░░▀▀▀▀▀▀▀▀▄░░▀▀▀▀▀▀▀░▄▀░
// ░░░░█░░▄█▀█▀▀█▀▀▀▀▀▀█▀▀█▀█▀▀█░░░
// ░░░░▀▀▀▀░░▀▀▀░░░░░░░░▀▀▀░░▀▀░░░░

#include <bits/stdc++.h>
using namespace std;

bool dbg = 0;
  
clock_t start_time = clock();
#define current_time fixed<<setprecision(6)<<(ld)(clock()-start_time)/CLOCKS_PER_SEC
  
#define f first
#define s second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define sqr(x) ((x) * (x))


#define ull unsigned long long
#define ll long long
#define ld long double
#define pii pair<int,int>
#define umap unordered_map<int, int>
  
#define files1 freopen("input.txt","r",stdin)
#define files2 freopen("output.txt","w",stdout)
#define files files1;files2
#define fast_io ios_base::sync_with_stdio(0);cin.tie(0)
  
#define endl '\n'
#define ln(i,n) " \n"[(i) == (n) - 1]
  
void bad(string mes = "Impossible"){cout << mes;exit(0);}
void bad(int mes){cout << mes;exit(0);}
  
template<typename T>
string bin(T x, int st = 2){
    string ans = "";
    while (x > 0){
        ans += char('0' + x % st);
        x /= st;
    }
    reverse(ans.begin(), ans.end());
    return ans.empty() ? "0" : ans;
}
  
mt19937_64 mt_rand(
    chrono::system_clock::now().time_since_epoch().count()
);

template<typename T1, typename T2> inline bool upmax(T1& a, T2 b) { return (a < b ? (a = b, true) : false); }
template<typename T1, typename T2> inline bool upmin(T1& a, T2 b) { return (b < a ? (a = b, true) : false); }

// inline int popcount(int x){
//     int count = 0;
//     __asm__ volatile("POPCNT %1, %0;":"=r"(count):"r"(x):);
//     return count;
// }
  
template<typename T>
T input(){
    T ans = 0, m = 1;
    char c = ' ';
  
    while (!((c >= '0' && c <= '9') || c == '-')) {
        c = getchar();
    }
  
    if (c == '-')
        m = -1, c = getchar();
    while (c >= '0' && c <= '9'){
        ans = ans * 10 + (c - '0'), c = getchar();
    }
    return ans * m;
}

template<typename T>
T gcd (T a, T b) { while (b) { a %= b; swap (a, b); } return a; }
  
template<typename T> void read(T& a) { a = input<T>(); }
template<typename T> void read(T& a, T& b) { read(a), read(b); }
template<typename T> void read(T& a, T& b, T& c) { read(a, b), read(c); }
template<typename T> void read(T& a, T& b, T& c, T& d) { read(a, b), read(c, d); }

const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-12;
const int maxn = (int)1e5 + 3, base = 998244353;
const ll llinf = 2e18 + 5;

int binpow(int a, int s) { 
    int res = 1;
    while (s) {
        if (s % 2) {
            res = 1ll * res * a % base;
        }
        a = 1ll * a * a % base;
        s /= 2;
    }
    return res;
}

bool bd(int a, int b) {
    return (a == 0 && b == 1) || (a == 1 && b == 0);
}

bool check(vector<int> s) {
    vector<int> st;
    for (int i = 0; i < s.size(); i++) {
        if (st.size() && !bd(st.back(), s[i]) && s[i] != 2) {
            st.pop_back();
        } else {
            st.pb(s[i]);
        }
    }
    while (st.size() >= 2 && !bd(st[st.size() - 2], st.back())) {
        st.pop_back();
        st.pop_back();
    }
    return st.size() == 0;
}

vector<int> st;
int res;

void gen(int l, int r) {
    if (l == r)  {
        res += check(st);
        return;
    }
    for (int j = 0; j < 3; j++) {
        st.pb(j);
        gen(l + 1, r);
        st.pop_back();
    }
}

int main() {
    // files1;
    fast_io;

    string s;
    cin >> s;

    ll sum = 0;

    if (s[0] == '>') {
        int x = 0;
        for (int j = 0; j < s.size() && s[j] == '>'; j++) x++;
        sum += x;
    }
    if (s[s.size() - 1] == '<') {
        int x = 0;
        for (int j = s.size() - 1; j >= 0 && s[j] == '<'; j--) x++;
        sum += x;
    }

    int cc = 0;
    vector<int> cl(s.size(), 0), cr(s.size(), 0);
    for (int i = 0; i < s.size(); i++) {
        if (s[i] == '<') {
            cc++;
        } else {
            cc = 0;
        }
        cl[i] = cc;
    }

    cc = 0;
    for (int i = s.size() - 1; i >= 0; i--) {
        if (s[i] == '>') {
            cc++;
        } else {
            cc = 0;
        }
        cr[i] = cc;
    }

    for (int i = 0; i + 1 < s.size(); i++) {
        if (s[i] == '<' && s[i + 1] == '<') {
            sum += cl[i];
            // cout << cl[i] << ' ';
        }
        if (s[i] == '>' && s[i + 1] == '>') {
            sum += cr[i + 1];
            // cout << cr[i + 1] << ' ';
        }
        if (s[i] == '<' && s[i + 1] == '>') {
            sum += max(cl[i], cr[i + 1]);
            // cout << max(cl[i], cr[i + 1]) << ' ';
        }
    }

    cout << sum;
    return 0;
}

Measured memory_bytes: 4764