#include <bits/stdc++.h>
using namespace std;
int break_point() {
  char c;
  while ((c = getchar()) != '\n')
    ;
  return 0;
}
template <typename T>
void read_integer(T &r) {
  bool sign = 0;
  r = 0;
  char c;
  while (1) {
    c = getchar();
    if (c == '-') {
      sign = 1;
      break;
    }
    if (c != ' ' && c != '\n') {
      r = c - '0';
      break;
    }
  }
  while (1) {
    c = getchar();
    if (c == ' ' || c == '\n') break;
    r = r * 10 + (c - '0');
  }
  if (sign) r = -r;
}
long long binpowmod(long long a, long long b, long long mod) {
  if (b == 0) return 1;
  long long c = binpowmod(a, b >> 1, mod);
  return (((c * c) % mod) * (b & 1 ? a : 1)) % mod;
}
long long binpow(long long a, long long b) {
  if (b == 0) return 1;
  long long c = binpow(a, b >> 1);
  return c * c * (b & 1 ? a : 1);
}
inline int getbit(int x, int b) { return (x >> b) & 1; }
inline int setbit(int x, int b) { return x | (1 << b); }
inline void _setbit(int &x, int b) { x = setbit(x, b); }
inline long long setbit(long long x, int b) { return x | (1ll << b); }
inline void _setbit(long long &x, int b) { x = setbit(x, b); }
inline int unsetbit(int x, int b) { return x & (INT_MAX - (1 << b)); }
inline void _unsetbit(int &x, int b) { x = unsetbit(x, b); }
inline int countbit(int x) {
  x = x - ((x >> 1) & 0x55555555);
  x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
  return ((x + (x >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
inline long long countbit(long long x) {
  return countbit(int(x & INT_MAX)) + countbit(int(x >> 32) & INT_MAX);
}
inline void printbit(int x, int len) {
  for (int i = len - 1; i >= 0; i--) printf("%d", getbit(x, i));
}
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
template <typename A, typename B>
ostream &operator<<(ostream &stream, const pair<A, B> &p) {
  stream << "{" << p.first << "," << p.second << "}";
  return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const vector<A> &v) {
  stream << "[";
  for (auto itr = v.begin(); itr != v.end(); itr++) stream << *itr << " ";
  stream << "]";
  return stream;
}
template <typename A, typename B>
ostream &operator<<(ostream &stream, const map<A, B> &v) {
  stream << "[";
  for (auto itr = v.begin(); itr != v.end(); itr++) stream << *itr << " ";
  stream << "]";
  return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const set<A> &v) {
  stream << "[";
  for (auto itr = v.begin(); itr != v.end(); itr++) stream << *itr << " ";
  stream << "]";
  return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const stack<A> &v) {
  stack<A> st = v;
  stream << "[";
  while (!st.empty()) {
    stream << st.top() << " ";
    st.pop();
  }
  stream << "]";
  return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const priority_queue<A> &v) {
  priority_queue<A> q = v;
  stream << "[";
  while (!q.empty()) {
    stream << q.top() << " ";
    q.pop();
  }
  stream << "]";
  return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const queue<A> &v) {
  queue<A> q = v;
  stream << "[";
  while (!q.empty()) {
    stream << q.front() << " ";
    q.pop();
  }
  stream << "]";
  return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const deque<A> &v) {
  deque<A> q = v;
  stream << "[";
  while (!q.empty()) {
    stream << q.front() << " ";
    q.pop_front();
  }
  stream << "]";
  return stream;
}
void run();
int main() {
  srand(time(NULL));
  run();
  return 0;
}
const int mod = 1e9 + 7;
const int N = 100005;
struct Point {
  int x, y;
  Point(int _x = 0, int _y = 0) : x(_x), y(_y) {}
};
vector<pair<Point, Point> > rects;
void send_query(Point a, Point b) {
  printf("? %d %d %d %d\n", a.x, a.y, b.x, b.y);
  fflush(stdout);
}
int calc_rects_inside(Point a, Point b) {
  int ret = 0;
  for (pair<Point, Point> r : rects)
    ret += a.x <= r.first.x && a.y <= r.first.y && b.x >= r.second.x &&
           b.y >= r.second.y;
  0 ? (cout << "ret"
            << " = " << (ret) << "\n")
    : cout;
  return ret;
}
pair<Point, Point> find_rect(Point from, Point to) {
  int cnt;
  int l = from.x, r = to.x;
  int e = from.x;
  while (l <= r) {
    int mid = (l + r) >> 1;
    send_query(Point(mid, from.y), to);
    scanf("%d", &cnt);
    cnt -= calc_rects_inside(Point(mid, from.y), to);
    if (cnt > 0) {
      e = mid;
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  from.x = e;
  l = from.x, r = to.x;
  e = to.x;
  while (l <= r) {
    int mid = (l + r) >> 1;
    send_query(from, Point(mid, to.y));
    scanf("%d", &cnt);
    cnt -= calc_rects_inside(from, Point(mid, to.y));
    if (cnt > 0) {
      e = mid;
      r = mid - 1;
    } else
      l = mid + 1;
  }
  to.x = e;
  l = from.y, r = to.y;
  e = from.y;
  while (l <= r) {
    int mid = (l + r) >> 1;
    send_query(Point(from.x, mid), to);
    scanf("%d", &cnt);
    cnt -= calc_rects_inside(Point(from.x, mid), to);
    if (cnt > 0) {
      e = mid;
      l = mid + 1;
    } else
      r = mid - 1;
  }
  from.y = e;
  l = from.y, r = to.y;
  e = to.y;
  while (l <= r) {
    int mid = (l + r) >> 1;
    send_query(from, Point(to.x, mid));
    scanf("%d", &cnt);
    cnt -= calc_rects_inside(from, Point(to.x, mid));
    if (cnt > 0) {
      e = mid;
      r = mid - 1;
    } else
      l = mid + 1;
  }
  to.y = e;
  return {from, to};
}
void run() {
  int n;
  scanf("%d", &n);
  rects.push_back(find_rect(Point(1, 1), Point(n, n)));
  rects.push_back(find_rect(Point(1, 1), Point(n, n)));
  vector<int> res;
  for (auto itr : rects) {
    res.push_back(itr.first.x);
    res.push_back(itr.first.y);
    res.push_back(itr.second.x);
    res.push_back(itr.second.y);
  }
  printf("!");
  for (int itr : res) printf(" %d", itr);
  putchar('\n');
  fflush(stdout);
}
