#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    auto ask = [&](int i, int x, int j, int y){
        cout << "? " << i+1 << ' ' << x+1 << ' ' << j+1 << ' ' << y+1 << endl;
        string s; cin >> s;
        return s == "Yes";
    };
    int i = 0, j = 1, k = 2;
    if(!ask(j, 2*n-1, k, 2*n-1)){
        swap(j, k);
    }
    if(!ask(i, 2*n-1, k, 2*n-1)){
        swap(i, k);
    }
    if(!ask(i, n-1, j, n-1)){
        swap(i, j);
    }
    cout << "! ";
    for(int iter = 0; iter < n; iter++){
        cout << j+1 << ' ' << k+1 << ' ';
    }
    for(int iter = 0; iter < n; iter++){
        cout << i+1 << ' ' << k+1 << ' ';
    }
    for(int iter = 0; iter < n; iter++){
        cout << i+1 << ' ' << j+1 << ' ';
    }
    cout << endl;
}