#include <bits/stdc++.h>
using namespace std;
const int maxn = 1100;
int n;
int query(int x, int y, int x2, int y2) {
  int answ = 0;
  cout << "? " << x << " " << y << " " << x2 << " " << y2 << endl;
  cin >> answ;
  return answ;
}
void bin_searchrow(int fx, int sx) {
  int index = n;
  int li = 1, ri = n, minv = n;
  while (li < ri) {
    int mid = (li + ri) / 2;
    if (query(fx, 1, fx, mid) % 2 == 1) {
      ri = mid;
      minv = min(minv, mid);
    } else {
      li = mid + 1;
    }
  }
  index = minv;
  int index2 = n;
  li = 1, ri = n, minv = n;
  while (li < ri) {
    int mid = (li + ri) / 2;
    if (query(sx, 1, sx, mid) % 2 == 1) {
      ri = mid;
      minv = min(minv, mid);
    } else {
      li = mid + 1;
    }
  }
  index2 = minv;
  cout << "! " << fx << " " << index << " " << sx << " " << index2 << endl;
  return;
}
void bin_searchcol(int fy, int sy) {
  int index = n;
  int li = 1, ri = n, minv = n;
  while (li < ri) {
    int mid = (li + ri) / 2;
    if (query(1, fy, mid, fy) % 2 == 1) {
      ri = mid;
      minv = min(minv, mid);
    } else {
      li = mid + 1;
    }
  }
  index = minv;
  int index2 = n;
  li = 1, ri = n, minv = n;
  while (li < ri) {
    int mid = (li + ri) / 2;
    if (query(1, sy, mid, sy) % 2 == 1) {
      ri = mid;
      minv = min(minv, mid);
    } else {
      li = mid + 1;
    }
  }
  index2 = minv;
  cout << "! " << index << " " << fy << " " << index2 << " " << sy << endl;
  return;
}
int main() {
  cin >> n;
  int fx = -1, sx = -1;
  int answ;
  for (int i = 1; i < n; i++) {
    cout << "? " << i << " " << 1 << " " << i << " " << n << endl;
    cin >> answ;
    if (answ % 2 == 1) {
      if (fx == -1) {
        fx = i;
      } else
        sx = i;
    }
  }
  if (fx != -1 && sx == -1) {
    sx = n;
  }
  if (fx != -1 && sx != -1) {
    bin_searchrow(fx, sx);
    return 0;
  }
  int fy = -1, sy = -1;
  for (int i = 1; i < n; i++) {
    cout << "? " << 1 << " " << i << " " << n << " " << i << endl;
    cin >> answ;
    if (answ % 2 == 1) {
      if (fy == -1) {
        fy = i;
      } else
        sy = i;
    }
  }
  if (fy != -1 && sy == -1) {
    sy = n;
  }
  bin_searchcol(fy, sy);
  return 0;
}
