#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &DataIn) {
  DataIn = 0;
  T Flag = 0;
  char c = getchar();
  while (!isdigit(c)) {
    Flag |= c == '-';
    c = getchar();
  }
  while (isdigit(c)) {
    DataIn = DataIn * 10 + c - '0';
    c = getchar();
  }
  DataIn = Flag ? -DataIn : DataIn;
}
template <class T>
inline void write(T DataOut, char EndChar = '\n') {
  T lenth = 0, number[30];
  if (DataOut == 0) {
    putchar(48);
    putchar(EndChar);
    return;
  }
  while (DataOut > 0) {
    number[++lenth] = DataOut % 10;
    DataOut /= 10;
  }
  for (int i = lenth; i >= 1; i--) putchar(number[i] + 48);
  putchar(EndChar);
}
const long long LLMAX = 2e18;
const int MOD = 1e9 + 7;
const double eps = 1e-8;
const int MAXN = 1e6 + 10;
inline int dcmp(double x) {
  if (fabs(x) < eps) return 0;
  return (x > 0 ? 1 : -1);
}
inline long long sqr(long long x) { return x * x; }
inline int sqr(int x) { return x * x; }
inline double sqr(double x) { return x * x; }
long long __gcd(long long a, long long b) {
  return b == 0 ? a : __gcd(b, a % b);
}
long long qpow(long long a, long long n) {
  long long sum = 1;
  while (n) {
    if (n & 1) sum = sum * a % MOD;
    a = a * a % MOD;
    n >>= 1;
  }
  return sum;
}
priority_queue<int, vector<int>, less<int> > qd;
priority_queue<int, vector<int>, greater<int> > qu;
int main(void) {
  int n, num;
  scanf("%d", &n);
  int left = n, right = 1, top = 1, bottom = n;
  vector<int> lr, tb;
  for (int i = 1; i <= n; i++) {
    printf("? %d %d %d %d\n", i, 1, i, n);
    fflush(stdout);
    scanf("%d", &num);
    if (num % 2) lr.push_back(i);
    if (num) {
      left = min(left, i);
      right = max(right, i);
    }
  }
  for (int i = 1; i <= n; i++) {
    printf("? %d %d %d %d\n", 1, i, n, i);
    fflush(stdout);
    scanf("%d", &num);
    if (num % 2) tb.push_back(i);
    if (num) {
      bottom = min(bottom, i);
      top = max(top, i);
    }
  }
  if (lr.size() == 0) {
    int l = 1, r = n, ans;
    while (l <= r) {
      int mid = (l + r) >> 1;
      printf("? %d %d %d %d\n", 1, tb[0], mid, tb[0]);
      fflush(stdout);
      scanf("%d", &num);
      if (num % 2)
        r = mid - 1, ans = mid;
      else
        l = mid + 1;
    }
    printf("! %d %d %d %d\n", ans, tb[0], ans, tb[1]);
  } else if (tb.size() == 0) {
    int l = 1, r = n, ans;
    while (l <= r) {
      int mid = (l + r) >> 1;
      printf("? %d %d %d %d\n", lr[0], 1, lr[0], mid);
      fflush(stdout);
      scanf("%d", &num);
      if (num % 2)
        r = mid - 1, ans = mid;
      else
        l = mid + 1;
    }
    printf("! %d %d %d %d\n", lr[0], ans, lr[1], ans);
  } else {
    vector<pair<int, int> > ans;
    for (int i = 0; i < lr.size(); i++)
      for (int j = 0; j < tb.size(); j++) {
        printf("? %d %d %d %d\n", lr[i], tb[j], lr[i], tb[j]);
        fflush(stdout);
        scanf("%d", &num);
        if (num == 1) ans.push_back(pair<int, int>(i, j));
      }
    printf("! %d %d %d %d\n", lr[ans[0].first], tb[ans[0].second],
           lr[ans[1].first], tb[ans[1].second]);
  }
  return 0;
}
