Problem:
Score : 300 points

Problem Statement

Given is a string S of length N-1.
Each character in S is < or >.

A sequence of N non-negative integers, a_1,a_2,\cdots,a_N, is said to be good when the following condition is satisfied for all i (1 \leq i \leq N-1):

If S_i= <: a_i<a_{i+1}

If S_i= >: a_i>a_{i+1}

Find the minimum possible sum of the elements of a good sequence of N non-negative integers.

Constraints

2 \leq N \leq 5 \times 10^5

S is a string of length N-1 consisting of < and >.

Input

Input is given from Standard Input in the following format:

S

Output

Find the minimum possible sum of the elements of a good sequence of N non-negative integers.

Sample Input 1

<>>

Sample Output 1

3

a=(0,2,1,0) is a good sequence whose sum is 3.
There is no good sequence whose sum is less than 3.

Sample Input 2

<>>><<><<<<<>>><

Sample Output 2

28

Solution in Rust (1.15.1) (judge verdict: Runtime Error)

#![allow(unused_parens)]
#![allow(unused_imports)]
#![allow(non_upper_case_globals)]



#[allow(unused_macros)]
macro_rules! invec {
    ( $ t : ty ) => {{
        let mut s = String::new();
        match std::io::stdin().read_line(&mut s) {
            Ok(0) => Vec::<$t>::new(),
            Ok(n) => s
                .trim()
                .split_whitespace()
                .map(|s| s.parse::<$t>().unwrap())
                .collect::<Vec<$t>>(),
            Err(_) => Vec::<$t>::new(),
        }
    }};
}

#[allow(unused_macros)]
macro_rules! get {
      ($t:ty) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.trim().parse::<$t>().unwrap()
          }
      };
      ($($t:ty),*) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              let mut iter = line.split_whitespace();
              (
                  $(iter.next().unwrap().parse::<$t>().unwrap(),)*
              )
          }
      };
      ($t:ty; $n:expr) => {
          (0..$n).map(|_|
              get!($t)
          ).collect::<Vec<_>>()
      };
      ($($t:ty),*; $n:expr) => {
          (0..$n).map(|_|
              get!($($t),*)
          ).collect::<Vec<_>>()
      };
      ($t:ty ;;) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.split_whitespace()
                  .map(|t| t.parse::<$t>().unwrap())
                  .collect::<Vec<_>>()
          }
      };
      ($t:ty ;; $n:expr) => {
          (0..$n).map(|_| get!($t ;;)).collect::<Vec<_>>()
      };
}

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [$t:tt]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}


#[cfg(debug_assertions)]
macro_rules! mydbg {
    //($arg:expr) => (dbg!($arg))
    //($arg:expr) => (println!("{:?}",$arg));
      ($($a:expr),*) => {
          eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
      }
}


#[cfg(not(debug_assertions))]
macro_rules! mydbg {
    ($($arg:expr),*) => {};
}



use std::cmp;
use std::collections::HashMap;


#[allow(dead_code)]
static INF_I64 :i64 = 9223372036854775807;
#[allow(dead_code)]
static INF_I32 : i32 = 2147483647;
#[allow(dead_code)]
static INF_USIZE : usize = 18446744073709551615;



fn main() {

    input! { 
       s: chars,
    }


    let mut tmp = vec![];

    let mut p = s[0];
    let mut c = 1;
    for i in 1..s.len(){
        if p == s[i] { c+= 1;}
        else {
            tmp.push(c);
            p=s[i];
            c=1;
        }
        if i == s.len()-1{
            tmp.push(c);
        }
    }
    

    mydbg!(tmp);

    if s[0] == '<'{
    let mut ans = 0;

    
    let mut r = 0;
    let mut ret = vec![];
    for i in 0..tmp.len()-1{
        if i % 2 != 0 {
            continue;
        }

        let a=tmp[i];
        let b=tmp[i+1];
        let c= cmp::max(a,b);

        r = cmp::max(r+a,c);

        for j in 0..a{
            ret.push(r-j);
            ans += r-j;
        }

        r = cmp::min(b,r);
        for j in 0..b{
            ret.push(r-1);
            ans += r-1;
            r-=1;
        }

        
    }

    if tmp.len() %2 != 0{
        let a= tmp[tmp.len()-1];
        for i in 0..a{
            ret.push(r+1);
            ans += r+1;
            r+=1;
        }
    }
    
    //mydbg!(ret);
    //let sum  = ret.iter().fold(0,|x,y|{x+y});
    //mydbg!(sum);
    println!("{}",ans);
    }
    
    if s[0] == '>'{
    let mut ans = 0;

    
    let mut r = 2147483647;
    let mut ret = vec![];
    for i in 0..tmp.len()-1{
        if i % 2 != 0 {
            continue;
        }

        let a=tmp[i];
        let b=tmp[i+1];
        let c= cmp::max(a,b);

        r = cmp::min(b,r);
        for j in 0..b{
            ret.push(r-1);
            ans += r-1;
            r-=1;
        }

        r = cmp::max(r+a,c);

        for j in 0..a{
            ret.push(r-j);
            ans += r-j;
        }

       

        
    }

    if tmp.len() %2 != 0{
        let a= tmp[tmp.len()-1];
        for i in 0..a{
            ret.push(r-1);
            ans += r-1;
            r-=1;
        }
    }
    
    //mydbg!(ret);
    //let sum  = ret.iter().fold(0,|x,y|{x+y});
    //mydbg!(sum);
    println!("{}",ans);
    }




}