B"In the Bus of Characters there are n rows of seat, each having 2 seats. The width of both seats in the i -th row is w_i centimeters. All integers w_i are distinct. Initially the bus is empty. On each of 2n stops one passenger enters the bus. There are two types of passengers: You are given the seats width in each row and the order the passengers enter the bus. Determine which row each passenger will take. The first line contains a single integer n ( 1 <= n <= 200 ,000 ) -- the number of rows in the bus. The second line contains the sequence of integers w_1, w_2, ... , w_n ( 1 <= w_i <= 10^{9} ), where w_i is the width of each of the seats in the i -th row. It is guaranteed that all w_i are distinct. The third line contains a string of length 2n , consisting of digits '0' and '1' -- the description of the order the passengers enter the bus. If the j -th character is '0', then the passenger that enters the bus on the j -th stop is an introvert. If the j -th character is '1', the the passenger that enters the bus on the j -th stop is an extrovert. It is guaranteed that the number of extroverts equals the number of introverts (i. e. both numbers equal n ), and for each extrovert there always is a suitable row. Print 2n integers -- the rows the passengers will take. The order of passengers should be the same as in input. In the first example the first passenger (introvert) chooses the row 2 , because it has the seats with smallest width. The second passenger (introvert) chooses the row 1 , because it is the only empty row now. The third passenger (extrovert) chooses the row 1 , because it has exactly one occupied seat and the seat width is the largest among such rows. The fourth passenger (extrovert) chooses the row 2 , because it is the only row with an empty place. "...