#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cout << #x << " = " << (x) << endl;
using Graph = vector<vector<int> >;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define int long long

void solve() {
	string s; cin >> s;
    int n = (int)s.size() + 1;
    int cnt1 = 0, cnt2 = 0;
    int res = 0;
    if(s[0] == '>') {
        cnt2 ++;
        rep1(i, n - 2) {
            if(s[i - 1] == '<' && s[i] == '<') {
                cnt1 ++;
            }else if(s[i - 1] == '<' && s[i] == '>') {
                cnt2 ++;
            }else if((s[i - 1] == '>' && s[i] == '<')) {
                if(cnt1 == 0) {
                    res += cnt2 * (cnt2 + 1) / 2;
                }else if(cnt2 == 0) {
                    res += cnt1 * (cnt1 + 1) / 2;
                }
                else if(cnt1 >= cnt2) {
                    res += cnt1 * (cnt1 + 1) / 2 + (cnt2 - 1) * (cnt2) / 2;
                } else if(cnt1 < cnt2) {
                    res += cnt2 * (cnt2 + 1) / 2 + (cnt1 - 1) * (cnt1) / 2;
                }
                cnt1 = 0; cnt2 = 0;
                cnt1 ++;
            }else if(s[i - 1] == '>' && s[i] == '>') {
                cnt2 ++;
            }
        }

        if(cnt1 == 0) {
                    res += cnt2 * (cnt2 + 1) / 2;
                }else if(cnt2 == 0) {
                    res += cnt1 * (cnt1 + 1) / 2;
                }
                else if(cnt1 >= cnt2) {
                    res += cnt1 * (cnt1 + 1) / 2 + (cnt2 - 1) * (cnt2) / 2;
                } else if(cnt1 < cnt2) {
                    res += cnt2 * (cnt2 + 1) / 2 + (cnt1 - 1) * (cnt1) / 2;
                }

    } else {
        cnt1 ++;
        rep1(i, n - 2) {
            if(s[i - 1] == '<' && s[i] == '<') {
                cnt1 ++;
            }else if(s[i - 1] == '<' && s[i] == '>') {
                cnt2 ++;
            }else if((s[i - 1] == '>' && s[i] == '<')) {
                if(cnt1 == 0) {
                    res += cnt2 * (cnt2 + 1) / 2;
                }else if(cnt2 == 0) {
                    res += cnt1 * (cnt1 + 1) / 2;
                }
                else if(cnt1 >= cnt2) {
                    res += cnt1 * (cnt1 + 1) / 2 + (cnt2 - 1) * (cnt2) / 2;
                } else if(cnt1 < cnt2) {
                    res += cnt2 * (cnt2 + 1) / 2 + (cnt1 - 1) * (cnt1) / 2;
                }
                cnt1 = 0; cnt2 = 0;
                cnt1 ++;
            }else if(s[i - 1] == '>' && s[i] == '>') {
                cnt2 ++;
            }
        }

                if(cnt1 == 0) {
                    res += cnt2 * (cnt2 + 1) / 2;
                }else if(cnt2 == 0) {
                    res += cnt1 * (cnt1 + 1) / 2;
                }
                else if(cnt1 >= cnt2) {
                    res += cnt1 * (cnt1 + 1) / 2 + (cnt2 - 1) * (cnt2) / 2;
                } else if(cnt1 < cnt2) {
                    res += cnt2 * (cnt2 + 1) / 2 + (cnt1 - 1) * (cnt1) / 2;
                }
    }
    cout << res << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	solve();
	//cout << "finish" << endl;
    return 0;
}

Measured memory_bytes: 1172