#include <bits/stdc++.h>
using namespace std;
const int block_size = 320;
const long long mod = 1e9 + 7;
const long long inf = 1e9 + 7;
const long double eps = 1e-9;
const double PI = atan(1) * 4;
template <typename T>
inline int sign(const T &a) {
  if (a < 0) return -1;
  if (a > 0) return 1;
  return 0;
}
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
template <typename T, typename S>
inline bool upmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
inline bool upmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline void in(T &x) {
  x = 0;
  T f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  x *= f;
}
long long twop(int x) { return 1LL << x; }
template <typename A, typename B>
inline void in(A &x, B &y) {
  in(x);
  in(y);
}
template <typename A, typename B, typename C>
inline void in(A &x, B &y, C &z) {
  in(x);
  in(y);
  in(z);
}
template <typename A, typename B, typename C, typename D>
inline void in(A &x, B &y, C &z, D &d) {
  in(x);
  in(y);
  in(z);
  in(d);
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
namespace SOLVE {
int n;
vector<pair<int, int> > ans;
int query(int x1, int y1, int x2, int y2) {
  printf("? %d %d %d %d\n", x1, y1, x2, y2);
  fflush(stdout);
  int cnt;
  cin >> cnt;
  return cnt % 2;
}
void solve_row(int row) {
  int l = 1, r = n;
  while (l != r) {
    int mid = (l + r) / 2;
    if (query(row, l, row, mid)) {
      r = mid;
    } else {
      l = mid + 1;
    }
  }
  ans.push_back(make_pair(row, l));
}
bool query_row() {
  vector<int> row;
  for (long long i = 1; i < n; i++) {
    if (query(i, 1, i, n)) {
      row.push_back(i);
    }
  }
  if (((int)row.size()) == 1) {
    row.push_back(n);
  }
  if (((int)row.size()) == 2) {
    solve_row(row[0]);
    solve_row(row[1]);
    return true;
  }
  return false;
}
void solve_col(int col) {
  int l = 1, r = n;
  while (l != r) {
    int mid = (l + r) / 2;
    if (query(l, col, mid, col)) {
      r = mid;
    } else {
      l = mid + 1;
    }
  }
  ans.push_back(make_pair(l, col));
}
bool query_col() {
  vector<int> row;
  for (long long i = 1; i < n; i++) {
    if (query(1, i, n, i)) {
      row.push_back(i);
    }
  }
  if (((int)row.size()) == 1) {
    row.push_back(n);
  }
  if (((int)row.size()) == 2) {
    solve_col(row[0]);
    solve_col(row[1]);
    return true;
  }
  return false;
}
void main() {
  in(n);
  if (!query_row()) {
    query_col();
  }
  cout << "!";
  for (auto i : ans) cout << " " << i.first << " " << i.second;
}
}  // namespace SOLVE
signed main() {
  int t;
  t = 1;
  while (t--) {
    SOLVE::main();
  }
  return 0;
}
