#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int n;

bool query(int i, int x, int j, int y) {
    assert(0 <= i and i < 3);
    assert(0 <= x and x < 2 * n);
    assert(0 <= j and j < 3);
    assert(0 <= y and y < 2 * n);
    cout << "? " << i + 1 << ' ' << x + 1 << ' ' << j + 1 << ' ' << y + 1 << ' ' << endl;
    string res;
    cin >> res;
    return res == "Yes";
}

void answer(const vector<pair<int, int>>& ans) {
    cout << '!';
    for (auto [i, j] : ans) cout << ' ' << i + 1 << ' ' << j + 1;
    cout << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;

    vector<int> ord(3);
    iota(all(ord), 0);
    if (query(ord[1], 2 * n - 1, ord[0], 2 * n - 1)) swap(ord[0], ord[1]);
    if (query(ord[2], 2 * n - 1, ord[1], 2 * n - 1)) swap(ord[1], ord[2]);
    if (query(ord[1], n - 1, ord[0], n - 1)) swap(ord[0], ord[1]);
    vector<pair<int, int>> ans;
    for (int i = 0; i < n; i++) ans.emplace_back(ord[1], ord[2]);
    for (int i = 0; i < n; i++) ans.emplace_back(ord[0], ord[2]);
    for (int i = 0; i < n; i++) ans.emplace_back(ord[0], ord[1]);
    answer(ans);
    return 0;
}