{"raw_statement":[{"iden":"problem statement","content":"Given is a string $S$ of length $N-1$. Each character in $S$ is `<` or `>`.\nA 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$):\n\n*   If $S_i=$ `<`: $a_i<a_{i+1}$\n*   If $S_i=$ `>`: $a_i>a_{i+1}$\n\nFind the minimum possible sum of the elements of a good sequence of $N$ non-negative integers."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 5 \\times 10^5$\n*   $S$ is a string of length $N-1$ consisting of `<` and `>`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"<>>"},{"iden":"sample output 1","content":"3\n\n$a=(0,2,1,0)$ is a good sequence whose sum is $3$. There is no good sequence whose sum is less than $3$."},{"iden":"sample input 2","content":"<>>><<><<<<<>>><"},{"iden":"sample output 2","content":"28"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}