#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B, typename C>
struct triple {
  A X;
  B Y;
  C Z;
  triple(A a = 0, B b = 0, C c = 0) : X(a), Y(b), Z(c) {}
};
template <typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
  return triple<A, B, C>(a, b, c);
}
template <typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
  if (a.X != b.X) return a.X < b.X;
  if (a.Y != b.Y) return a.Y < b.Y;
  return a.Z < b.Z;
}
template <typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
  ofs << "( " << p.first << " , " << p.second << " )";
  return ofs;
}
template <typename T>
void print(T a) {
  for (auto i : a) cout << i << ' ';
  cout << '\n';
}
template <typename T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
template <typename T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
struct rect {
  long long x1, y1, x2, y2;
  bool valid() const { return x1 <= x2 and y1 <= y2; }
  bool inside(rect r) const {
    return r.x1 <= x1 and x2 <= r.x2 and r.y1 <= y1 and y2 <= r.y2;
  }
  long long ask() const {
    cout << "? " << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;
    long long x;
    cin >> x;
    return x;
  }
};
rect solve(long long n, function<bool(rect)> ok) {
  rect ans{1, 1, n, n};
  for (long long step = 1 << 20; step; step >>= 1) {
    ans.x1 += step;
    if (!ans.valid() or !ok(ans)) ans.x1 -= step;
  }
  for (long long step = 1 << 20; step; step >>= 1) {
    ans.y1 += step;
    if (!ans.valid() or !ok(ans)) ans.y1 -= step;
  }
  for (long long step = 1 << 20; step; step >>= 1) {
    ans.x2 -= step;
    if (!ans.valid() or !ok(ans)) ans.x2 += step;
  }
  for (long long step = 1 << 20; step; step >>= 1) {
    ans.y2 -= step;
    if (!ans.valid() or !ok(ans)) ans.y2 += step;
  }
  return ans;
}
signed main() {
  srand(time(NULL));
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  long long n;
  cin >> n;
  rect r1 = solve(n, [](rect r) { return r.ask() > 0; });
  rect r2 =
      solve(n, [r1](rect r) { return r.ask() - (long long)r1.inside(r) > 0; });
  cout << "! " << r1.x1 << ' ' << r1.y1 << ' ' << r1.x2 << ' ' << r1.y2 << ' '
       << r2.x1 << ' ' << r2.y1 << ' ' << r2.x2 << ' ' << r2.y2 << '\n';
}
