#include<bits/stdc++.h>
//#include <ext/pb_ds/detail/standard_policies.hpp>
 
const double pi=acos(-1.0);
//memset ( a , 0 , n * sizeof(ll) ) ;
using namespace std;
//using namespace __gnu_pbds; 
#define   endl    '\n'
#define   sl(n)     scanf("%lld",&n)
#define   mp      make_pair
#define   pb      push_back
#define   ppb     pop_back
#define   fi      first
#define   se      second
#define   ll      long long
#define   ull     unsigned long long
#define   ld      long double
#define   pii     pair<int, int>
#define   f(i,a,b)  for(ll i = (ll)(a); i < (ll)(b); i++)
#define   rf(i,a,b)   for(ll i = (ll)(a); i > (ll)(b); i--)
#define   ms(a,b)   memset((a),(b),sizeof(a))
#define   abs(x)    ((x<0)?(-(x)):(x))
#define   MAX     1000005
#define   inf     LLONG_MAX
#define   ninf    LLONG_MIN
#define   MIN     INT_MIN
#define   yeet    return 0;
#define fast_io ios_base::sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0) ;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// Use cout.flush() for interactive problems.
// Use this for increased stack size: g++ -o a.exe -Wl,--stack=256000000 -O2 source.cpp
inline long long  MAX2(long long  a, long long  b){return (a)>(b)?(a):(b);}
inline long long  MAX3(long long  a, long long  b,long long  c){return (a)>(b)?((a)>(c)?(a):(c)):((b)>(c)?(b):(c));}
inline long long  MIN2(long long  a, long long  b){return (a)<(b)?(a):(b);}
inline long long  MIN3(long long  a, long long b,long long c){return (a)<(b)?((a)<(c)?(a):(c)):((b)<(c)?(b):(c));}

//typedef
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int  uint64;
 
 
int mod = 1e9 +7 ;
int64_t extGcd(int64_t a, int64_t b, int64_t& x, int64_t& y) {if (!a) {x = 0;y = 1;return b;}int64_t x1, y1;int64_t d = extGcd(b % a, a, x1, y1);x = y1 - (b / a) * x1;y = x1;return d;}

inline int addMod(int a, int b, int m = mod) {return ((int64_t)a + b) % m;}
inline int mulMod(int a, int b, int m = mod) {  return ((int64_t)a * b) % m;}
inline int divMod(int a, int b, int m = mod) {int64_t x, y;int64_t g = extGcd(b, m, x, y);if (g != 1) {cerr << "Bad gcd!" << endl;for (;;);}x = (x % m + m) % m;return mulMod(a, x, m);}
int dx[]={1,1,0,-1,-1,-1, 0, 1};
int dy[]={0,1,1, 1, 0,-1,-1,-1}; 
inline ll exp(ll a,ll b){if(a==0)return 0ll;ll r=1LL;while(b>0){if(b&1){r=r*(a%mod);r=(r+mod)%mod;}b/=2;a=(a%mod)*(a%mod);a=(a+mod)%mod;}return (r+mod)%mod;}
ll gcd(ll a,ll b){if(b==0)return a;if(a==0)return b;return gcd(b,a%b);}
uint32 setbits(ll n){uint32 count=0;while (n){n&=(n-1);count++;}return count; } 
// ll f[MAX];
// ll iv[MAX];
// ll C(ll n,ll r){
// 	 if(n<r)return 0;
// 	 ll ans=(f[n]%mod * iv[r]%mod)%mod;
// 	 ans=(ans%mod * iv[n-r]%mod)%mod;
// 	 return ans%mod;
// }
// void init(){
// 	 f[0]=1;
//      iv[0]=1;
//      f(i,1,MAX)f[i]=(i*f[i-1])%mod;
//      iv[MAX-1]=exp(f[MAX-1],mod-2);

//      for(int i=MAX-2;i>=0;--i)iv[i]=(iv[i+1]*(i+1))%mod;
	 
// }

////****************************************************************************************************************************************************************************************************************////


 int main(){
 	string s;
 	cin>>s;
 	//if(s.size()==2){cout<<1<<endl;return 0;}
 	vector<ll>g1;
 	 ll prev=0;

 	 for(int i=0;i<s.size();i++){
 	 	    if(s[i]=='>'){  g1.pb(prev);prev--;}
 	 	     else { g1.pb(prev); prev++;}
 	 } 
 	 g1.pb(prev);
 	 // cout<<"SSSS "<<g1.size()<<endl; 
    // for(int i:g1)cout<<i<<"  ";
    // cout<<endl;
     vector<ll>mn;
     if(g1[0]<g1[1])mn.pb(0);
     for(int i=1;i<g1.size()-1;i++){
     	 if(g1[i-1]> g1[i] and g1[i+1]>g1[i])mn.pb(i);
     }
     if(g1[g1.size()-1]<g1[g1.size()-2])mn.pb(g1.size()-1);
       //  cout<<"sz "<<mn.size()<<endl;

   //  for(int i:mn)cout<<i<<" "<<g1[i]<<endl;
   int n=g1.size();
    ll ans[n];
    ms(ans,0);
     for(int i=0;i<mn.size();i++){
     	  int start=mn[i];
     	  // cout<<start<<endl;
     	  // continue;
     	  ans[start]=0;
     	   for(int j=start-1;j>=0;j--){
     	   	   if(g1[j]>g1[j+1])ans[j]=MAX2(ans[j+1]+1,ans[j]);
     	   	   else break;
     	   }
     	   for(int j=start+1;j<g1.size();j++){
     	   	    if(g1[j]>g1[j-1]){ans[j]=MAX2(ans[j-1]+1,ans[j]);       	
     	   	       //	 cout<<g1[j]<<" "<<g1[j-1]<<endl;
}
     	   	    else break;
     	   }
     }
     // for(int i=0;i<n;i++)cout<<ans[i]<<" ";
//      
     // cout<<endl;
     ll sum=0;
     for(int i=0;i<n;i++)sum+=ans[i];
     cout<<sum<<endl;

	  }

Measured memory_bytes: 10484