#pragma GCC optimize("O2") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define int ll #define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1) #define INT128_MIN (-INT128_MAX - 1) #define clock chrono::steady_clock::now().time_since_epoch().count() #ifdef DEBUG #define dbg(x) cout << (#x) << " = " << x << '\n' #else #define dbg(x) #endif namespace R = std::ranges; namespace V = std::views; using namespace std; using ll = long long; using ull = unsigned long long; using ldb = long double; using pii = pair; using pll = pair; //#define double ldb template ostream& operator<<(ostream& os, const pair pr) { return os << pr.first << ' ' << pr.second; } template ostream& operator<<(ostream& os, const array &arr) { for(const T &X : arr) os << X << ' '; return os; } template ostream& operator<<(ostream& os, const vector &vec) { for(const T &X : vec) os << X << ' '; return os; } template ostream& operator<<(ostream& os, const set &s) { for(const T &x : s) os << x << ' '; return os; } bool ask(int i, int x, int j, int y) { cout << "? " << i << ' ' << x << ' ' << j << ' ' << y << '\n'; string s; cin >> s; return s == "Yes"; } void answer(vector> x) { cout << "!"; for(auto [a, b] : x) cout << ' ' << a << ' ' << b; cout << '\n'; } signed main() { //ios::sync_with_stdio(false), cin.tie(NULL); int n; cin >> n; int mx = 1; for(int j : {2, 3}) if (ask(mx, 2 * n, j, 2 * n)) mx = j; int a = 1 + (mx == 1); int b = 6 - a - mx; array p; if (ask(a, n, b, n)) p = {a, b, mx}; else p = {b, a, mx}; vector> ans; for(int i = 0; i < n; i++) ans.push_back({p[1], p[2]}); for(int i = 0; i < n; i++) ans.push_back({p[0], p[2]}); for(int i = 0; i < n; i++) ans.push_back({p[0], p[1]}); answer(ans); return 0; }