This is an interactive problem!

As part of your contribution in the Great Bubble War, you have been tasked with finding the newly built enemy fortress. The world you live in is a giant 10^9 × 10^9 grid, with squares having both coordinates between 1 and 10^9. 

You know that the enemy base has the shape of a rectangle, with the sides parallel to the sides of the grid. The people of your world are extremely scared of being at the edge of the world, so you know that the base doesn't contain any of the squares on the edges of the grid (the x or y coordinate being 1 or 10^9). 

To help you locate the base, you have been given a device that you can place in any square of the grid, and it will tell you the manhattan distance to the closest square of the base. The manhattan distance from square (a, b) to square (p, q) is calculated as |a−p|+|b−q|. If you try to place the device inside the enemy base, you will be captured by the enemy. Because of this, you need to make sure to never place the device inside the enemy base. 

Unfortunately, the device is powered by a battery and you can't recharge it. This means that you can use the device at most 40 times. 

Input

The input contains the answers to your queries. 

Interaction

Your code is allowed to place the device on any square in the grid by writing "? i j" (1 ≤ i,j ≤ 10^9). In return, it will recieve the manhattan distance to the closest square of the enemy base from square (i,j) or -1 if the square you placed the device on is inside the enemy base or outside the grid. 

If you recieve -1 instead of a positive number, exit immidiately and you will see the wrong answer verdict. Otherwise, you can get an arbitrary verdict because your solution will continue to read from a closed stream.

Your solution should use no more than 40 queries. 

Once you are sure where the enemy base is located, you should print "! x y p q" (1 ≤ x ≤ p≤ 10^9, 1 ≤ y ≤ q≤ 10^9), where (x, y) is the square inside the enemy base with the smallest x and y coordinates, and (p, q) is the square inside the enemy base with the largest x and y coordinates. Note that answering doesn't count as one of the 40 queries.

After printing a query or printing the answer, do not forget to output end of line and flush the output. Otherwise, you will get idleness limit exceeded. To do this, use: 

  * fflush(stdout) or cout.flush() in C++; 
  * System.out.flush() in Java; 
  * flush(output) in Pascal; 
  * stdout.flush() in Python; 
  * See the documentation for other languages.

Example

Input


1
1
2
1


Output


? 2 2
? 5 5
? 4 7
? 1 5
! 2 3 4 5
500000000 500000000 999999999 999999999
 123 123 999999999 999999999
 2 2 456 456
 444 8898 445 888888
 100 100 1000 1000
 456 456 456456 456456
 2 3 4 5
 3 3 6 6
 2 2 999999999 999999999
 999999998 2 999999999 3
 888 4444 666666 4445
 2 6 8 9
 999999998 999999998 999999999 999999999
 789 789 4564 1000000
 2 999999998 3 999999999
 2 2 3 3

4
 4
 ? 1 1
? 1000000000 1
? 500000000 1
? 500000000 1000000000
! -453 457 1000000454 999999544
 ? 1 1
? 1000000000 1
? 499995773 1
? 499995773 1000000000
! 0 446 999991547 999111112
 ? 1 1
? 1000000000 1
? 500000000 1
? 500000000 1000000000
! -899 1001 1000000900 999999000
 ? 1 1
? 1000000000 1
? 500000000 1
? 500000000 1000000000
! -455999 456457 1000456000 999543544
 ? 1 1
? 1000000000 1
? 500000000 1
? 500000000 1000000000
! -1 5 1000000001 999999995
 ? 1 1
? 1000000000 1
? 500000000 1
? 500000000 1000000000
! -2 7 1000000003 999999994
 4
 4
 ? 1 1
? 1000000000 1
? 499998222 1
? 499998222 1000000000
! -665777 666667 1000662222 999995555
 ? 1 1
? 1000000000 1
? 499999998 1
? 499999998 1000000000
! -5 9 1000000002 999999991
 4
 ? 1 1
? 1000000000 1
? 500000000 1
? 500000000 1000000000
! -3774 4565 1000003775 999000000
 4
 ? 1 1
? 1000000000 1
? 500000000 1
? 500000000 1000000000
! 0 4 1000000001 999999997

#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
  char ch;
  bool ok;
  for (ok = 0, ch = getchar(); !isdigit(ch); ch = getchar())
    if (ch == '-') ok = 1;
  for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
    ;
  if (ok) x = -x;
}
const int maxn = 110, mod = 998244353;
int ask(int x, int y) {
  int now;
  printf("? %d %d\n", x, y);
  fflush(stdout);
  read(now);
  return now;
}
int d1, d2, d3, d5, n = 1e9;
int main() {
  d1 = ask(1, 1), d2 = ask(n, 1);
  d3 = ask(1 + (n - 1 + d1 - d2) / 2, 1);
  d5 = ask(1 + (n - 1 + d1 - d2) / 2, n);
  printf("! %d %d %d %d\n", 1 + d1 - d3, 1 + d3, n - (d2 - d3), n - d5);
  fflush(stdout);
}
