Raju and the Binary String Mystery

Problem Statement

Raju and the Binary String Mystery Problem Description Raju loves playing with binary strings. Initially, he had a binary string. He performed the following operation zero or more times: Add a 0 to one end of the string and a 1 to the other end of the string. For example, starting with the string "1011" , Raju could obtain either: "010111" (adding 0 to the left and 1 to the right), or "110110" (adding 1 to the left and 0 to the right). Now, Raju shows you his final string. Your task is to determine the shortest possible length of the original string he could have started with. A binary string is a string whose characters are either 0 or 1 . Raju's original string could have been empty, in which case the shortest possible length is 0 . Input Format The first line contains an integer n — the length of Raju's final string. The second line contains a binary string s of length n . Output Format Output a single integer — the shortest possible length of Raju's original string. Examples Exampl