Problem: This is an interactive problem. Remember to flush your output while communicating with the testing program. You may use fflush(stdout) in C++, system.out.flush() in Java, stdout.flush() in Python or flush(output) in Pascal to flush the output. If you use some other programming language, consult its documentation. You may also refer to the guide on interactive problems: <https://codeforces.com/blog/entry/45307>.

The jury guessed some array a consisting of 6 integers. There are 6 special numbers — 4, 8, 15, 16, 23, 42 — and each of these numbers occurs in a exactly once (so, a is some permutation of these numbers).

You don't know anything about their order, but you are allowed to ask up to 4 queries. In each query, you may choose two indices i and j (1 ≤ i, j ≤ 6, i and j are not necessarily distinct), and you will get the value of a_i ⋅ a_j in return.

Can you guess the array a?

The array a is fixed beforehand in each test, the interaction program doesn't try to adapt to your queries.

Interaction

Before submitting the answer, you may ask up to 4 queries. To ask a query, print one line in the following format: ? i j, where i and j should be two integers such that 1 ≤ i, j ≤ 6. The line should be ended with a line break character. After submitting a query, flush the output and read the answer to your query — one line containing one integer a_i ⋅ a_j. If you submit an incorrect query (or ask more than 4 queries), the answer to it will be one string 0. After receiving such an answer, your program should terminate immediately — otherwise you may receive verdict "Runtime error", "Time limit exceeded" or some other verdict instead of "Wrong answer".

To give the answer, your program should print one line ! a_1 a_2 a_3 a_4 a_5 a_6 with a line break in the end. After that, it should flush the output and terminate gracefully.

Example

Input


16
64
345
672

Output


? 1 1
? 2 2
? 3 5
? 4 6
! 4 8 15 16 23 42

Note

If you want to submit a hack for this problem, your test should contain exactly six space-separated integers a_1, a_2, ..., a_6. Each of 6 special numbers should occur exactly once in the test. The test should be ended with a line break character.

Solution (in JAVA):

Solution:
import javafx.scene.layout.Priority;
import java.io.*;
import java.lang.reflect.Array;
import java.net.Inet4Address;
import java.util.*;
import java.lang.*;
import java.util.HashMap;
import java.util.PriorityQueue;
public class templ implements Runnable {
    static class pair implements Comparable
    {
        int f;
        int s;
        pair(int fi,int se)
        {
            f=fi;
            s=se;
        }
        public int compareTo(Object o)
        {
            pair pr=(pair)o;
            if(s>pr.s)
                return 1;
            if(s==pr.s)
            {
                if(f<pr.f)
                    return 1;
                else
                    return -1;
            }
            else
                return -1;
        }
        public boolean equals(Object o)
        {
            pair ob=(pair)o;
            int ff;
            int ss;
            if(o!=null)
            {
                ff=ob.f;
                ss=ob.s;
                if((ff==this.f)&&(ss==this.s))
                    return true;
            }
            return false;
        }
        public int hashCode()
        {
            return (this.f+" "+this.s).hashCode();
        }
    }
    public class triplet implements Comparable
    {
        int f,t;
        int s;
        triplet(int f,int s,int t)
        {
            this.f=f;
            this.s=s;
            this.t=t;
        }
        public boolean equals(Object o)
        {
            triplet ob=(triplet)o;
            int ff;
            int ss;
            int tt;
            if(o!=null)
            {
                ff=ob.f;
                ss=ob.s;
                tt=ob.t;
                if((ff==this.f)&&(ss==this.s)&&(tt==this.t))
                    return true;
            }
            return false;
        }
        public int hashCode()
        {
            return (this.f+" "+this.s+" "+this.t).hashCode();
        }
        public int compareTo(Object o)
        {
            triplet tr=(triplet)o;
            if(t>tr.t)
                return 1;
            else
                return -1;
        }
    }
    public static void main(String args[])throws Exception
    {
        new Thread(null,new templ(),"templ",1<<27).start();
    }
    public void run()
    {
        try
        {
            InputReader in = new InputReader(System.in);
            PrintWriter out = new PrintWriter(System.out);
            int a[]=new int[5];
            for(int i=1;i<=4;i++)
            {
                out.println("? "+i+" "+(i+1));
                out.flush();
                a[i]=in.ni();
            }
            HashSet<Integer>hs=new HashSet<>();
            hs.add(4);
            hs.add(15);
            hs.add(8);
            hs.add(16);
            hs.add(23);
            hs.add(42);
            HashMap<Integer,Integer>hm=new HashMap<>();
            for(int i=1;i<=3;i++)
            {
                if(a[i]%23==0&&a[i+1]%23==0)
                {
                    hm.put(i + 1, 23);
                    hs.remove(23);
                }
                if(a[i]%5==0&&a[i+1]%5==0)
                {
                    hm.put(i + 1, 15);
                    hs.remove(15);
                }
                if(a[i]%7==0&&a[i+1]%7==0)
                {
                    hm.put(i + 1, 42);
                    hs.remove(42);
                }
            }
            if(a[3]%23!=0&&a[4]%23==0)
            {
                hm.put(5, 23);
                hs.remove(23);
            }
            if(a[3]%5!=0&&a[4]%5==0)
            {
                hm.put(5, 15);
                hs.remove(15);
            }
            if(a[3]%7!=0&&a[4]%7==0)
            {
                hm.put(5, 42);
                hs.remove(42);
            }
            if(a[2]%23!=0&&a[1]%23==0)
            {
                hm.put(1, 23);
                hs.remove(23);
            }
            if(a[2]%5!=0&&a[1]%5==0)
            {
                hm.put(1, 15);
                hs.remove(15);
            }
            if(a[2]%7!=0&&a[1]%7==0)
            {
                hm.put(1, 42);
                hs.remove(42);
            }
            if(hs.contains(23))
            {
                hm.put(6,23);
                hs.remove(23);
            }
            if(hs.contains(15))
            {
                hm.put(6,15);
                hs.remove(15);
            }
            if(hs.contains(42))
            {
                hm.put(6,42);
                hs.remove(42);
            }
            for(int j=1;j<=10;j++)
            {
                for (int i = 1; i <= 4; i++)
                {
                    if (hm.containsKey(i) && (!hm.containsKey(i + 1)))
                    {
                        int k = a[i] / hm.get(i);
                        hs.remove(k);
                        hm.put(i + 1, k);
                    }
                    if (hm.containsKey(i + 1) && (!hm.containsKey(i)))
                    {
                        int k = a[i] / hm.get(i + 1);
                        hs.remove(k);
                        hm.put(i, k);
                    }
                }
            }
            if(!hs.isEmpty())
            {
                int k=0;
                for(int i : hs)
                    k=i;
                hm.put(6,k);
            }
            out.print("! ");
            for(int i=1;i<=6;i++)
            {
                out.print(hm.get(i)+" ");
            }
            out.flush();
            out.close();
        }
        catch(Exception e){
            return;
        }
    }
    static class InputReader {

        private final InputStream stream;
        private final byte[] buf = new byte[8192];
        private int curChar, snumChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (snumChars == -1)
                throw new InputMismatchException();
            if (curChar >= snumChars) {
                curChar = 0;
                try {
                    snumChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (snumChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int ni() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public long nl() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public int[] nextIntArray(int n) {
            int a[] = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = ni();
            }
            return a;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public String nextLine() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndOfLine(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        private boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }

    }
}