Filya just learned new geometry object — rectangle. He is given a field consisting of n × n unit cells. Rows are numbered from bottom to top with integer from 1 to n . Columns are numbered from left to right with integers from 1 to n . Cell, located at the intersection of the row r and column c is denoted as ( r , c ) . Filya has painted two rectangles, such that their sides are parallel to coordinate axes and each cell lies fully inside or fully outside each of them. Moreover, no cell lies in both rectangles. Later, hedgehog Filya became interested in the location of his rectangles but was unable to find the sheet of paper they were painted on. They were taken by Sonya and now she wants to play a little game with Filya. He tells her a query rectangle and she replies with the number of initial rectangles that lie fully inside the given query rectangle. The query rectangle should match the same conditions as initial rectangles. Rectangle lies fully inside the query if each o its cells lies inside the query. Filya knows Sonya really well, so is sure that if he asks more than 200 questions she will stop to reply. The first line of the input contains an integer n ( 2 ≤ n ≤ 2 16 ) — size of the field. For each query an integer between 0 and 2 is returned — the number of initial rectangles that lie fully inside the query rectangle. To make a query you have to print " ? x 1 y 1 x 2 y 2 " (without quotes) ( 1 ≤ x 1 ≤ x 2 ≤ n , 1 ≤ y 1 ≤ y 2 ≤ n ), where ( x 1 , y 1 ) stands for the position of the bottom left cell of the query and ( x 2 , y 2 ) stands for the up right cell of the query. You are allowed to ask no more than 200 queries. After each query you should perform "flush" operation and read the answer. In case you suppose you've already determined the location of two rectangles (or run out of queries) you should print " ! x 11 y 11 x 12 y 12 x 21 y 21 x 22 y 22 " (without quotes), where first four integers describe the bottom left and up right cells of the f