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 C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApp1
{
    class Program
    {
        static void Main(string[] args)
        {
            char[] S = Console.ReadLine().ToCharArray();
            var count_1 = new int[S.Count() + 1];
            var count_2 = new int[S.Count() + 1];
            var count = new int[S.Count() + 1];


            count_1[0] = 0;
            count_2[S.Count()] = 0;

            var index = 1;
            for (int i = 0; i < S.Count(); i++)
            {
                if(S[i] == '<')
                {
                    count_1[i+1] += index;
                    index++;
                }
                else
                {
                    count_1[i+1] =0;
                    index = 1;
                }

              // Console.WriteLine(count_1[i]);
            }
            

            index = 1;
            for (int i = S.Count(); i >0 ; i--)
            {
                if (S[i-1] == '>')
                {
                    count_2[i-1] += index;
                    index++;
                }
                else
                {
                    count_2[i-1] = 0;
                    index = 1;
                }

                //Console.WriteLine(count_2[i]);
            }

            for (int i = 0; i < S.Count() + 1; i++)
            {
                count[i] = Math.Max(count_1[i],count_2[i]);
            }

            Console.WriteLine(count.Sum());
        }
    }
}