#include using namespace std; using ll = long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; #define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep2(i, a, b) rep3(i, a, b, 1) #define rep1(i, n) rep2(i, 0, n) #define rep0(n) rep1(aaaaa, n) #define ov4(a, b, c, d, name, ...) name #define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__) #define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--) #define fore(e, v) for (auto&& e : v) #define all(a) begin(a), end(a) #define sz(a) (int)(size(a)) #define lb(v, x) (lower_bound(all(v), x) - begin(v)) #define eb emplace_back template bool chmin(T& a, const S& b) { return a > b ? a = b, 1 : 0; } template bool chmax(T& a, const S& b) { return a < b ? a = b, 1 : 0; } const int INF = 1e9 + 100; const ll INFL = 3e18 + 100; #define i128 __int128_t struct _ { _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); } } __; int main(){ int N; cin>>N; vector cnt; auto check=[&](vi B){ cout<<"? "<>S; return (S=="Yes"); }; rep(i,1,N+1){ int c=0; while(1){ if(check(vi(c+1,i))){ c++; }else{ break; } } if(c>0)cnt.push_back(pii{c,i}); } sort(all(cnt)); auto merge_vec=[&](vi A,vi B){ int b=0; rep(i,sz(A)){ auto tmp=A; tmp.insert(tmp.begin()+i,B[b]); if(check(tmp)){ A.insert(A.begin()+i,B[b]); b++; if(b==sz(B))break; } } rep(i,b,sz(B))A.push_back(B[i]); return A; }; auto comp_vec=[&](const vi& v1,const vi& v2) -> bool { return sz(v1)>sz(v2); }; priority_queue,decltype(comp_vec)> pq(comp_vec); fore(i,cnt){ pq.push(vi(i.first,i.second)); } while(sz(pq)>1){ auto v1=pq.top(); pq.pop(); auto v2=pq.top(); pq.pop(); pq.push(merge_vec(v1, v2)); } vi ans=pq.top(); cout<<"!"; fore(i,ans)cout<<' '<