Problem: This is an interactive problem.

After getting AC after 13 Time Limit Exceeded verdicts on a geometry problem, Kuroni went to an Italian restaurant to celebrate this holy achievement. Unfortunately, the excess sauce disoriented him, and he's now lost!

The United States of America can be modeled as a tree (why though) with n vertices. The tree is rooted at vertex r, wherein lies Kuroni's hotel.

Kuroni has a phone app designed to help him in such emergency cases. To use the app, he has to input two vertices u and v, and it'll return a vertex w, which is the lowest common ancestor of those two vertices.

However, since the phone's battery has been almost drained out from live-streaming Kuroni's celebration party, he could only use the app at most ⌊ n/2 ⌋ times. After that, the phone would die and there will be nothing left to help our dear friend! :(

As the night is cold and dark, Kuroni needs to get back, so that he can reunite with his comfy bed and pillow(s). Can you help him figure out his hotel's location?

Interaction

The interaction starts with reading a single integer n (2 ≤ n ≤ 1000), the number of vertices of the tree.

Then you will read n-1 lines, the i-th of them has two integers x_i and y_i (1 ≤ x_i, y_i ≤ n, x_i ≠ y_i), denoting there is an edge connecting vertices x_i and y_i. It is guaranteed that the edges will form a tree.

Then you can make queries of type "? u v" (1 ≤ u, v ≤ n) to find the lowest common ancestor of vertex u and v.

After the query, read the result w as an integer.

In case your query is invalid or you asked more than ⌊ n/2 ⌋ queries, the program will print -1 and will finish interaction. You will receive a Wrong answer verdict. Make sure to exit immediately to avoid getting other verdicts.

When you find out the vertex r, print "! r" and quit after that. This query does not count towards the ⌊ n/2 ⌋ limit.

Note that the tree is fixed beforehand and will not change during the queries, i.e. the interactor is not adaptive.

After printing any query do not forget to print end of line and flush the output. Otherwise, you might get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++;
  * System.out.flush() in Java;
  * flush(output) in Pascal;
  * stdout.flush() in Python;
  * see the documentation for other languages.



Hacks

To hack, use the following format:

The first line should contain two integers n and r (2 ≤ n ≤ 1000, 1 ≤ r ≤ n), denoting the number of vertices and the vertex with Kuroni's hotel.

The i-th of the next n-1 lines should contain two integers x_i and y_i (1 ≤ x_i, y_i ≤ n) — denoting there is an edge connecting vertex x_i and y_i.

The edges presented should form a tree.

Example

Input


6
1 4
4 2
5 3
6 3
2 3

3

4

4



Output








? 5 6

? 3 1

? 1 2

! 4

Note

Note that the example interaction contains extra empty lines so that it's easier to read. The real interaction doesn't contain any empty lines and you shouldn't print any extra empty lines as well.

The image below demonstrates the tree in the sample test:

<image>

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

public class D {

    private void work() {
        Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(System.in), 1 << 16));

        n = Integer.parseInt(sc.nextLine().trim());
        adj = new int[n][n];
        deg = new int[n];

        for (int i = 0; i < n - 1; i++) {
            String[] spl = sc.nextLine().trim().split("\\s+");
            int u = Integer.parseInt(spl[0]) - 1;
            int v = Integer.parseInt(spl[1]) - 1;
            adj[u][deg[u]++] = v;
            adj[v][deg[v]++] = u;
        }

        int[] idx = new int[n];
        for (int i = 0; i < n; i++) idx[i] = i;
        for (int i = 0; i < n; i++) {
            for (int j = n - 1; j > i; j--) {
                if (deg[idx[i]] > deg[idx[j]]) {
                    int t = idx[i];
                    idx[i] = idx[j];
                    idx[j] = t;
                }
            }
        }

        int[] p = new int[n];
        Arrays.fill(p, -1);
        int cnt = n - 1;

        for (int i = 0; i < n; i += 2) {
            int u = idx[i];
            int v = idx[i + 1];
            System.out.printf("? %d %d\n", u + 1, v + 1);
            System.out.flush();

            int w = Integer.parseInt(sc.nextLine().trim()) - 1;
            if (w < 0) {
                System.exit(0);
            }

            if (w == u || w == v) {
                if (deg[w] == 1) {
                    System.out.printf("! %d\n", w + 1);
                    System.out.flush();
                    System.out.close();
                    sc.close();
                    System.exit(0);
                }

                int s;
                if (w == u) s = v;
                else s = u;

                while (p[s] >= 0 && s != w) s = p[s];
                if (s != w) {
                    List<Integer> path = search(s, w);
                    for (int j = 0; j < path.size() - 1; j++) {
                        int uu = path.get(j);
                        int vv = path.get(j + 1);
                        if (p[uu] < 0) {
                            cnt--;
                            p[uu] = vv;
                        }
                    }
                }
            } else {
                int s = u;
                while (p[s] >= 0 && s != w) s = p[s];
                if (s != w) {
                    List<Integer> path = search(s, w);
                    for (int j = 0; j < path.size() - 1; j++) {
                        int uu = path.get(j);
                        int vv = path.get(j + 1);
                        if (p[uu] < 0) {
                            cnt--;
                            p[uu] = vv;
                        }
                    }
                }

                s = v;
                while (p[s] >= 0 && s != w) s = p[s];
                if (s != w) {
                    List<Integer> path = search(s, w);
                    for (int j = 0; j < path.size() - 1; j++) {
                        int uu = path.get(j);
                        int vv = path.get(j + 1);
                        if (p[uu] < 0) {
                            cnt--;
                            p[uu] = vv;
                        }
                    }
                }
            }

            if (cnt == 0) {
                for (int j = 0; j < n; j++) {
                    if (p[idx[j]] < 0) {
                        System.out.printf("! %d\n", idx[j] + 1);
                        System.out.flush();
                        System.out.close();
                        sc.close();
                        System.exit(0);
                    }
                }
            }
        }

        for (int j = 0; j < n; j++) {
            if (p[idx[j]] < 0) {
                System.out.printf("! %d\n", idx[j] + 1);
                System.out.flush();
                System.out.close();
                sc.close();
                System.exit(0);
            }
        }
    }

    private int n;
    private int[] deg;
    private int[][] adj;

    private List<Integer> search(int u, int w) {
        Queue<State> q = new LinkedList<>();
        boolean[] seen = new boolean[n];
        q.add(new State(u, null));
        seen[u] = true;
        List<Integer> path = new ArrayList<>();
        while (!q.isEmpty()) {
            State cur = q.poll();
            if (cur.u == w) {
                while (cur != null) {
                    path.add(0, cur.u);
                    cur = cur.prev;
                }
                break;
            }
            for (int i = 0; i < deg[cur.u]; i++) {
                int v = adj[cur.u][i];
                if (!seen[v]) {
                    q.add(new State(v, cur));
                    seen[v] = true;
                }
            }
        }

        return path;
    }

    public static void main(String[] args) {
        new D().work();
    }

    static class State {
        int u;
        State prev;

        State(int u, State prev) {
            this.u = u;
            this.prev = prev;
        }
    }
}