#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> res;
void search(int c, bool d) {
  int l = 1, r = n;
  int a;
  while (l < r) {
    int m = (l + r) >> 1;
    if (d)
      cout << "? " << l << " " << c << " " << m << " " << c << endl;
    else
      cout << "? " << c << " " << l << " " << c << " " << m << endl;
    cin >> a;
    if (a % 2) {
      r = m;
    } else {
      l = m + 1;
    }
  }
  if (!d) swap(l, c);
  res.push_back(l);
  res.push_back(c);
}
void solve() {
  int c;
  for (int i = 1; i <= n; ++i) {
    cout << "? " << 1 << " " << i << " " << n << " " << i << endl;
    cin >> c;
    if (c % 2) {
      search(i, true);
    }
  }
  if (res.size()) return;
  for (int i = 1; i <= n; ++i) {
    cout << "? " << i << " " << 1 << " " << i << " " << n << endl;
    cin >> c;
    if (c % 2) {
      if (res.size()) {
        res.push_back(i);
        res.push_back(res[1]);
        break;
      }
      search(i, false);
    }
  }
}
int main() {
  cin >> n;
  solve();
  cout << "! ";
  for (int x : res) cout << x << " ";
  cout << endl;
}
