#include<bits/stdc++.h>
using namespace std;
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)
#define F first
#define S second
#define eb emplace_back
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define PI 3.141592653589
// Input
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define llin(a) cin >> a
#define inl(a) scanf("%lld",&a)
#define read(v,i,n) for(i=0;i<n;i++)in(v[i])
#define twod(mat,i,j,n,m) rep(i,n){rep(j,m)in(mat[i][j]);}
#define sc(ch) scanf("%c",&ch)
#define sstr(str) scanf("%s",str)
// Output
#define pr(a) printf("%d ",a)
#define pr2(a,b) printf("%d %d\n",a,b)
#define pr3(a,b,c) printf("%d %d %d\n",a,b,c)
#define out(a) printf("%d\n",a)
#define outl(a) printf("%lld\n",a)
#define llpr(a) cout << a << " "
#define llout(a) cout << a << "\n"
#define yes printf("YES\n")
#define no printf("NO\n")
#define lin printf("\n")
// Iterator
#define lp(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define all(vec) vec.begin(),vec.end()
#define lower(v,k) lower_bound(v.begin(),v.end(),k)-v.begin()
#define upper(v,k) upper_bound(v.begin(),v.end(),k)-v.begin()
#define tf(mytuple) get<0>(mytuple)
#define ts(mytuple) get<1>(mytuple)
#define tt(mytuple) get<2>(mytuple)
// Debug
#define dbg(v,i,n) for(i=0;i<n;i++)pr(v[i]); lin
#define what(x) cerr << #x << " : " << x << "\n"
#define ck printf("continue\n")
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
	cerr << *it << " = " << a << "\n";
	err(++it, args...);
}
// Data Type
#define ll long long int
#define ii pair<int,int>
#define pli pair<ll,int>
#define state tuple<int,int,int>
#define vi vector<int>
#define vii vector<pair<int,int> >
#define vvi vector<vector<int> >
#define viii vector<pair<pair<int,int>,int> >
#define vvii vector<vector<pair<int,int> > >
#define M 1000000007
#define B 300  //check the limits, man
#define N 1000003
const ll INF = 1e18;
int main()
{
    int i,n,x,f;
    string str;
    llin(str);
    n=str.size();
    n++;
    vi v(n);
    v[0]=0;
    rep(i,n)
    {
        if(str[i]=='>')
            v[i+1]=v[i]-1;
        else
            v[i+1]=v[i]+1;
    }
    x=0;
    rep(i,n)
        x=min(x,v[i]);
    rep(i,n)
        v[i]-=x;
    f=1;
    while(f)
    {
        f=0;
        rep(i,n)
        {
            if(i==0 && v[i]<v[i+1] && v[i]>0)
                v[i]=0,f=1;
            else if(i==n-1 && v[i]<v[n-2] && v[i]>0)
                v[n-1]=0,f=1;
            else if(i>0 && i<n-1 && v[i-1]>v[i] && v[i]<v[i+1] && v[i]>0)
                v[i]=0,f=1;
        }
        lp(i,1,n-1)
        {
            if(v[i-1]>v[i] && v[i]<v[i+1] && v[i]>0)
                v[i]=0,f=1;
            else if(v[i-1]<v[i] && v[i]>v[i+1] && v[i]>max(v[i-1],v[i+1])+1)
                v[i]=max(v[i-1],v[i+1])+1,f=1;
            else if(v[i-1]>v[i] && v[i]>v[i+1] && v[i]>v[i+1]+1)
                v[i]=v[i+1]+1,f=1;
            else if(v[i-1]<v[i] && v[i]<v[i+1] && v[i]>v[i-1]+1)
                v[i]=v[i-1]+1,f=1;
        }
        for(i=n-2;i>0;i--)
        {
            if(v[i-1]>v[i] && v[i]<v[i+1] && v[i]>0)
                v[i]=0,f=1;
            else if(v[i-1]<v[i] && v[i]>v[i+1] && v[i]>max(v[i-1],v[i+1])+1)
                v[i]=max(v[i-1],v[i+1])+1,f=1;
            else if(v[i-1]>v[i] && v[i]>v[i+1] && v[i]>v[i+1]+1)
                v[i]=v[i+1]+1,f=1;
            else if(v[i-1]<v[i] && v[i]<v[i+1] && v[i]>v[i-1]+1)
                v[i]=v[i-1]+1,f=1;
        }
    }
    if(v[0]>v[1])
        v[0]=v[1]+1;
    if(v[n-1]>v[n-2])
        v[n-1]=v[n-2]+1;
    ll sum=0;
    rep(i,n)
        sum+=v[i];
    llout(sum);
    return 0;
}


Measured memory_bytes: 2820