#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y);
long long mpower(long long x, long long y, long long p);
long long modInv(long long a, long long m);
long long gcdExtended(long long a, long long b, long long *x, long long *y);
bool isPrime(long long n);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, i, j, k, l, h, p, q, r, x, y, z, a, b, c, d, f, n, m,
      M = 1000000007;
  char ch, ch2, ch3;
  string s, s1, s2, s3;
  vector<long long> v, w;
  vector<pair<long long, long long> > vv;
  vector<long long>::iterator itrv;
  unordered_map<long long, long long> N;
  set<long long> S;
  set<long long>::iterator itr;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cout << "? " << i << " 1 " << i << " " << n << endl;
    cin >> p;
    if (p % 2) {
      v.push_back(i);
    }
  }
  for (i = 1; i <= n; i++) {
    cout << "? 1 " << i << " " << n << " " << i << endl;
    cin >> p;
    if (p % 2) {
      w.push_back(i);
    }
  }
  if (v.size() == 2 && w.size() == 2) {
    cout << "? " << v[0] << " " << w[0] << " " << v[0] << " " << w[0] << endl;
    cin >> x;
    if (x == 1) {
      vv.push_back(make_pair(v[0], w[0]));
    }
    cout << "? " << v[0] << " " << w[1] << " " << v[0] << " " << w[1] << endl;
    cin >> x;
    if (x == 1) {
      vv.push_back(make_pair(v[0], w[1]));
    }
    cout << "? " << v[1] << " " << w[0] << " " << v[1] << " " << w[0] << endl;
    cin >> x;
    if (x == 1) {
      vv.push_back(make_pair(v[1], w[0]));
    }
    cout << "? " << v[1] << " " << w[1] << " " << v[1] << " " << w[1] << endl;
    cin >> x;
    if (x == 1) {
      vv.push_back(make_pair(v[1], w[1]));
    }
    cout << "! " << vv[0].first << " " << vv[0].second << " " << vv[1].first
         << " " << vv[1].second << endl;
    return 0;
  }
  if (v.size() == 0) {
    l = 1;
    h = n;
    while (l < h) {
      p = (l + h) / 2;
      cout << "? " << l << " " << w[0] << " " << p << " " << w[0] << endl;
      cin >> x;
      if (x % 2) {
        h = p;
      } else {
        l = p + 1;
      }
    }
    cout << "! " << l << " " << w[0] << " " << l << " " << w[1] << endl;
    return 0;
  } else {
    l = 1;
    h = n;
    while (l < h) {
      p = (l + h) / 2;
      cout << "? " << v[0] << " " << l << " " << v[0] << " " << p << endl;
      cin >> x;
      if (x % 2) {
        h = p;
      } else {
        l = p + 1;
      }
    }
    cout << "! " << v[0] << " " << l << " " << v[1] << " " << l << endl;
    return 0;
  }
  return 0;
}
long long modInv(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long mpower(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  long long p = sqrt(n);
  for (int i = 5; i <= p; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
