There is a knot in the middle of necklace of n beads at the left and the right. The red and the blue beads are randomly strung into it. You want to make the number of red and the blue beads equal by removing some of them\n. As there is a knot in the middle, you cannot remove the beads passing the knot. You can remove the only from each end of the necklace. You are required to print minimum number of beads you should remove to make number of remaining red and the blue beads equal same. Although removing all beads from the necklace will always make the number of both colors equal to zero. They are a way to remove a small number of beads.\ngiven integer N and a string A whose length is 2N\nthe knot is in the middle of 2N length\nexamples:\n\nN=6,\nA=RBBRRRBRRBRB\nanswer is 6\n\nremoving total of 6 beads, one from the left and five from the right, will leave three beads of each color\n\nN=2\nA=RBRB\nanswer is 0\n\nN=3\nA=RRRRRR\nanswer is 6\n

There is a knot in the middle of necklace of n beads at the left and the right. The red and the blue beads are randomly strung into it. You want to make the num