#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

int main(){
    
    int N;cin>>N;
    vector<pair<int,int>> ask;
    vector<int> res;
    
    for(int a=1;a<=3;a++){
        for(int b=a+1;b<=3;b++){
            cout<<"?"<<" "<<a<<" "<<2*N<<" "<<b<<" "<<2*N<<endl;
            string S;cin>>S;
            ask.push_back(mp(a-1,b-1));
            if(S=="Yes") res.push_back(1);
            else res.push_back(0);
        }
    }
    
    vector<int> P={1,2,3};
    
    do{
        bool ok=true;
        for(int t=0;t<3;t++){
            if(res[t]==1){
                ok&=(P[ask[t].fi]<P[ask[t].se]);
            }else{
                ok&=(P[ask[t].fi]>=P[ask[t].se]);
            }
        }
        
        if(!ok) continue;
        
        cout<<"!";
        for(int i=1;i<=N;i++) cout<<" "<<P[1]<<" "<<P[2];
        for(int i=1;i<=N;i++) cout<<" "<<P[0]<<" "<<P[2];
        for(int i=1;i<=N;i++) cout<<" "<<P[0]<<" "<<P[1];
        cout<<endl;
        return 0;
    }while(next_permutation(all(P)));
}