#include <bits/stdc++.h>
#include <cassert>
using namespace std;
using ll = long long int;
using u64 = unsigned long long;
using pll = pair<ll, ll>;
// #include <atcoder/all>
// using namespace atcoder;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define REPrev(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(coll) (coll).begin(), (coll).end()
#define SIZE(v) ((ll)((v).size()))
#define REPOUT(i, a, b, exp, sep) REP(i, (a), (b)) cout << (exp) << (i + 1 == (b) ? "" : (sep)); cout << "\n"

// @@ !! LIM()

int main(/* int argc, char *argv[] */) {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << setprecision(20);


  ll N; cin >> N;
  // @InpMVec(N -1, ((U, dec=1), (V, dec=1))) [ddBeA6SQ]
  auto U = vector(N -1, ll());
  auto V = vector(N -1, ll());
  for (int i = 0; i < N -1; i++) {
    ll v1; cin >> v1; v1 -= 1; U[i] = v1;
    ll v2; cin >> v2; v2 -= 1; V[i] = v2;
  }
  // @End [ddBeA6SQ]
  ll k0 = bit_ceil((u64)(N - 1));

  auto ask = [&](auto& vec) -> ll {
    cout << "?";
    for (ll v : vec) cout << " " << v + 1;
    cout << endl;
    string s; cin >> s;
    if (s == "Yes") return 1;
    else if (s == "No") return 0;
    else assert(false);
  };
  auto report = [&](ll nd) -> void {
    cout << "! " << nd + 1 << endl;
  };

  ll x = 0;
  REP(k, 0, k0) {
    vector<ll> vec;
    REP(i, 0, N - 1) {
      if (i >> k & 1) vec.push_back(U[i]);
      else            vec.push_back(V[i]);
    }
    ll b = ask(vec);
    x |= (b << k);
  }
  ll y = ((1LL << k0) - 1) ^ x;
  if (y >= N - 1) report(U[x]);
  else if (x >= N - 1) report(V[y]);
  else {
    vector<ll> vec2;
    REP(i, 0, N - 1) {
      vec2.push_back(U[i]);
    }
    ll b2 = ask(vec2);
    if (b2) report(U[x]);
    else    report(V[y]);
  }

  

  return 0;
}