#include <bits/stdc++.h>
using namespace std;
int an[11];
int inside(int x1, int y1, int x2, int y2) {
  return an[1] >= x1 && an[2] >= y1 && an[3] <= x2 && an[4] <= y2;
}
int ask(int x1, int y1, int x2, int y2) {
  printf("? %d %d %d %d\n", x1, y1, x2, y2);
  fflush(stdout);
  int a;
  scanf("%d", &a);
  return a;
}
int main() {
  int n;
  scanf("%d", &n);
  int lo = 0, hi = n;
  while (hi - lo > 1) {
    int m = (lo + hi) / 2;
    if (ask(1, 1, m, n) == 0)
      lo = m;
    else
      hi = m;
  }
  an[3] = hi;
  lo = 1, hi = hi + 1;
  while (hi - lo > 1) {
    int m = (lo + hi) / 2;
    if (ask(m, 1, an[3], n) == 0)
      hi = m;
    else
      lo = m;
  }
  an[1] = lo;
  lo = 0, hi = n;
  while (hi - lo > 1) {
    int m = (lo + hi) / 2;
    if (ask(an[1], 1, an[3], m) == 0)
      lo = m;
    else
      hi = m;
  }
  an[4] = hi;
  lo = 1, hi = an[4] + 1;
  while (hi - lo > 1) {
    int m = (lo + hi) / 2;
    if (ask(an[1], m, an[3], an[4]) == 0)
      hi = m;
    else
      lo = m;
  }
  an[2] = lo;
  lo = 0, hi = n;
  while (hi - lo > 1) {
    int m = (lo + hi) / 2;
    if (ask(1, 1, m, n) - inside(1, 1, m, n) == 0)
      lo = m;
    else
      hi = m;
  }
  an[7] = hi;
  lo = 1, hi = hi + 1;
  while (hi - lo > 1) {
    int m = (lo + hi) / 2;
    if (ask(m, 1, an[7], n) - inside(m, 1, an[7], n) == 0)
      hi = m;
    else
      lo = m;
  }
  an[5] = lo;
  lo = 0, hi = n;
  while (hi - lo > 1) {
    int m = (lo + hi) / 2;
    if (ask(an[5], 1, an[7], m) - inside(an[5], 1, an[7], m) == 0)
      lo = m;
    else
      hi = m;
  }
  an[8] = hi;
  lo = 1, hi = an[8] + 1;
  while (hi - lo > 1) {
    int m = (lo + hi) / 2;
    if (ask(an[5], m, an[7], an[8]) - inside(an[5], m, an[7], an[8]) == 0)
      hi = m;
    else
      lo = m;
  }
  an[6] = lo;
  printf("!");
  for (int i = 1; i <= 8; i++) printf(" %d", an[i]);
  printf("\n");
  fflush(stdout);
  return 0;
}
