B"Nikolay lives in a two-storied house. There are n rooms on each floor, arranged in a row and numbered from one from left to right. So each room can be represented by the number of the floor and the number of the room on this floor (room number is an integer between 1 and n ). If Nikolay is currently in some room, he can move to any of the neighbouring rooms (if they exist). Rooms with numbers i and i+1 on each floor are neighbouring, for all 1 <= q i <= q n - 1 . There may also be staircases that connect two rooms from different floors having the same numbers. If there is a staircase connecting the room x on the first floor and the room x on the second floor, then Nikolay can use it to move from one room to another. Nikolay wants to move through some rooms in his house. To do this, he firstly chooses any room where he starts. Then Nikolay moves between rooms according to the aforementioned rules. Nikolay never visits the same room twice (he won't enter a room where he has already been). Calculate the maximum number of rooms Nikolay can visit during his tour, if: The first line of the input contains one integer t ( 1 <= t <= 100 ) -- the number of test cases in the input. Then test cases follow. Each test case consists of two lines. The first line contains one integer n (1 <= n <= 1 ,000) -- the number of rooms on each floor. The second line contains one string consisting of n characters, each character is either a '0' or a '1'. If the i -th character is a '1', then there is a staircase between the room i on the first floor and the room i on the second floor. If the i -th character is a '0', then there is no staircase between the room i on the first floor and the room i on the second floor. In hacks it is allowed to use only one test case in the input, so t = 1 should be satisfied. For each test case print one integer -- the maximum num"...