#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
auto query(int i, int x, int j, int y) {
	cout << "? " << i << ' ' << x << ' ' << j << ' ' << y << endl;
	cout.flush();
	string s; cin >> s;
	return s == "Yes";
}
auto answer(int n, int i, int j, int k) {
	cout << "!";
	rep(_, n)cout << " " << i << " " << k;
	rep(_, n)cout << " " << j << " " << k;
	rep(_, n)cout << " " << i << " " << j;
	cout << endl;
	std::cout.flush();
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	int i, j, k;
	if (query(1, 2 * n, 2, 2 * n)) i = 1, j = 3, k = 2;
	else i = 2, j = 3, k = 1;
	if (query(k, 2 * n, j, n * 2)) swap(j, k);
	if (query(i, n, j, n)) swap(i, j);
	answer(n, i, j, k);
	return 0;
}