#include <bits/stdc++.h>
using namespace std;
int n;
int inIt(int a, int b, int c, int d) {
  int tmp;
  cout << "? " << a << " " << b << " " << c << " " << d << endl;
  fflush(stdout);
  cin >> tmp;
  return tmp;
}
void solve(int& x, int& y, int k, int t) {
  int l = 1, r = n;
  while (l < r) {
    int mid = (l + r) / 2;
    int tmp;
    if (t)
      tmp = inIt(k, l, k, mid);
    else
      tmp = inIt(l, k, mid, k);
    if (tmp % 2)
      r = mid;
    else
      l = mid + 1;
  }
  x = k, y = l;
  if (!t) swap(x, y);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int x[2] = {0}, y[2] = {0}, id = 0;
  cin >> n;
  for (int i = 1; i < n; i++) {
    if (inIt(i, 1, i, n) % 2) {
      solve(x[id], y[id], i, 1);
      id++;
    }
  }
  if (id == 1) {
    solve(x[id], y[id], n, 1);
    id++;
  }
  if (!id) {
    for (int i = 1; i < n; i++) {
      if (inIt(1, i, n, i) % 2) {
        solve(x[id], y[id], i, 0);
        id++;
      }
    }
    if (id == 1) {
      solve(x[id], y[id], n, 0);
      id++;
    }
  }
  cout << "! " << x[0] << " " << y[0] << " " << x[1] << " " << y[1] << endl;
  return 0;
}
