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: Accepted)

#![allow(non_snake_case)]

use std::cmp::max;
use std::io::Read;

fn main() {
    let mut buf = String::new();
    std::io::stdin().read_to_string(&mut buf).unwrap();
    let s = buf.chars().collect::<Vec<char>>();
    let n = buf.len() + 1;
    let mut vs: Vec<i64> = vec![0; n];

    for i in 0..n - 1 {
        if s[i] == '<' {
            vs[i + 1] = vs[i] + 1;
        }
    }

    for i in 0..n - 1 {
        let j = n - 2- i;
        if s[j] == '>' {
            vs[j] = max(vs[j + 1] + 1, vs[j]);
        }
    }
    println!("{}", vs.iter().fold(0, |sum, elem| sum + *elem));
}