B'Very soon, the new cell phone services provider "BerLine" will begin its work in Berland! The start of customer service is planned along the main street of the capital. There are n base stations that are already installed. They are located one after another along the main street in the order from the 1 -st to the n -th from left to right. Currently, all these base stations are turned off. They will be turned on one by one, one base station per day, according to some permutation p = [p_1, p_2, ... , p_n] ( 1 <= p_i <= n ), where p_i is the index of a base station that will be turned on on the i -th day. Thus, it will take n days to turn on all base stations. Each base station is characterized by its operating frequency f_i -- an integer between 1 and 24 , inclusive. There is an important requirement for operating frequencies of base stations. Consider an arbitrary moment in time. For any phone owner, if we consider all base stations turned on in the access area of their phone, then in this set of base stations there should be at least one whose operating frequency is unique among the frequencies of these stations. Since the power of the phone and the position are not known in advance, this means that for any nonempty subsegment of turned on base stations, at least one of them has to have the operating frequency that is unique among the stations of this subsegment. For example, let 's take a look at a case of n = 7 , all n stations are turned on, and their frequencies are equal to f = [1, 2, 1, 3, 1, 2, 1] . Consider any subsegment of the base stations -- there is a base station with a unique frequency within this subsegment. However, if f = [1, 2, 1, 2, 3, 2, 1] , then there is no unique frequency on the segment [1, 2, 1, 2] from the index 1 to the index 4 , inclusive. Your task is to assign a frequency from 1 to 24 to each of n bas'...