Given a binary string S of size N. You had been given the task to convert the given string into Fair string.

You can do the following operation any number of times. . If the ith character in S is 0, replace it with 1 using cost C[i]. . If the ith character in S is 1, replace it with 0 using cost C[i]. You have to determine the minimum cost used to convert the given string into Fair string.

A string S is a Fair string if it is either of type