Problem: This is an interactive problem. You should use flush operation after each printed line. For example, in C++ you should use fflush(stdout), in Java you should use System.out.flush(), and in Pascal — flush(output).

In this problem you should guess an array a which is unknown for you. The only information you have initially is the length n of the array a.

The only allowed action is to ask the sum of two elements by their indices. Formally, you can print two indices i and j (the indices should be distinct). Then your program should read the response: the single integer equals to ai + aj.

It is easy to prove that it is always possible to guess the array using at most n requests.

Write a program that will guess the array a by making at most n requests.

Interaction

In each test your program should guess a single array.

The input starts with a line containing integer n (3 ≤ n ≤ 5000) — the length of the array. Your program should read it at first.

After that your program should print to the standard output the requests about the sum of two elements or inform that the array is guessed.

  * In case your program is making a request to ask the sum of two elements, it should print line in the format "? i j" (i and j are distinct integers between 1 and n), where i and j are indices in the array a.
  * In case your program informs that the array is guessed, it should print line in the format "! a1 a2 ... an" (it is guaranteed that all ai are positive integers not exceeding 105), where ai is the i-th element of the array a. 



The response on a request is a single integer equal to ai + aj, printed on a separate line.

Your program can do at most n requests. Note that the final line «! a1 a2 ... an» is not counted as a request.

Do not forget about flush operation after each printed line.

After you program prints the guessed array, it should terminate normally.

Example

Input

5
 
9
 
7
 
9
 
11
 
6
 

Output

 
? 1 5
 
? 2 3
 
? 4 1
 
? 5 2
 
? 3 4
 
! 4 6 1 5 5

Note

The format of a test to make a hack is:

  * The first line contains an integer number n (3 ≤ n ≤ 5000) — the length of the array.
  * The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 105) — the elements of the array to guess. 

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.lang.*;

public final class Main {

    int inint(String s) {
        if (s.equals("S")) {
            return 0;
        } else if (s.equals("M")) {
            return 1;
        } else if (s.equals("L")) {
            return 2;
        } else if (s.equals("XL")) {
            return 3;
        } else if (s.equals("XXL")) {
            return 4;
        } else if (s.equals("XXXL")) {
            return 5;
        }
        return 0;
    }

    String instr(int i) {
        switch (i) {
            case 0:
                return "S";
            case 1:
                return "M";
            case 2:
                return "L";
            case 3:
                return "XL";
            case 4:
                return "XXL";
            case 5:
                return "XXXL";
        }
        return null;
    }

    private void solve() {
//        int[] foot = new int[6];
//        for (int i = 0; i < 6; i++) {
//            foot[i] = in.nextInt();
//        }
//        int n = in.nextInt();
//        int[][] k = new int[n][3];
//        int first = 0;
//        int last = n-1;
//        for (int i = 0; i < n; i++) {
//            int[] tmp = new int[2];
//            StringTokenizer stringTokenizer = new StringTokenizer(in.nextLine(), ",");
//            tmp[0] = inint(stringTokenizer.nextToken());
//            tmp[1] = 100;
//            if (stringTokenizer.countTokens() == 1)
//                tmp[1] = inint(stringTokenizer.nextToken());
//            if (tmp[1] != 100) {
//                k[last][0] = tmp[0];
//                k[last][1] = tmp[1];
//                k[last][2] = i;
//                last--;
//            } else {
//                k[first][0] = tmp[0];
//                k[first][1] = tmp[1];
//                k[last][2] = i;
//                first++;
//            }
//        }
//        String[] s = new String[n];
//        for (int i = 0; i < n; i++) {
//            if (k[i][1] == 100) {
//                if (foot[k[i][0]] > 0) {
//                    foot[k[i][0]]--;
//                    s[k[i][2]]=instr(k[i][0]) + "\n";
//                } else {
//                    out.print("NO");
//                    return;
//                }
//            } else {
//                if (foot[k[i][0]] > foot[k[i][1]]) {
//                    if (foot[k[i][0]] > 0) {
//                        foot[k[i][0]]--;
//                        s[k[i][2]]=instr(k[i][0]) + "\n";
//                    } else {
//                        out.print("NO");
//                        return;
//                    }
//                } else {
//                    if (foot[k[i][1]] > 0) {
//                        foot[k[i][1]]--;
//                        s[k[i][2]]=instr(k[i][1]) + "\n";
//                    } else {
//                        out.print("NO");
//                        return;
//                    }
//                }
//            }
//        }
//        out.println("YES");
//        for (int i=0; i<n;i++){
//            out.print(s[i]);
//        }
        int n = in.nextInt();
        long a[] = new long[n];
        for (int i = 1; i <= 3; i++) {
            int tmp = (i % (3)) + 1;
            out.println("? " + i + " " + tmp);
            out.flush();
            a[i - 1] = in.nextLong();
        }
        long[] answ = new long[n];
        answ[2] = a[2];
        for (int i = 0; i < 2; i++) {
            if (i % 2 == 0)
                answ[2] -= a[i];
            else
                answ[2] += a[i];
        }
        answ[2]=(answ[2]/2);
        answ[0]=a[2]-answ[2];
        answ[1]=a[1]-answ[2];
        for (int i = 4; i <= n; i++) {
            out.println("? " + 1 + " " + i);
            out.flush();
            answ[i-1]=in.nextInt()-answ[0];
        }
        out.print("! ");
        for (int i=0;i<n;i++){
            out.print(answ[i]+" ");
        }
        out.flush();
    }


    //    -------------I/O-------------    \\

    void run() {
        try {
            in = new FScanner(new File("input.txt"));
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File("output.txt"))));
            solve();
            out.close();
            in.close();
        } catch (IOException ex) {
            ex.printStackTrace();
        }
    }

    void runIO() {
        in = new FScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        solve();
        out.close();
        in.close();
    }

    public static void main(String[] args) {
        new Main().runIO();
    }

    private FScanner in;
    private PrintWriter out;

    class FScanner {

        private BufferedReader br;
        private StringTokenizer st;

        public FScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException ex) {
                ex.printStackTrace();
            }
        }

        void useString(String s) {
            if (s != null) {
                st = new StringTokenizer(s);
            }
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String s = "";
            try {
                s = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return s;
        }

        void close() {
            try {
                br.close();
            } catch (IOException ex) {
                ex.printStackTrace();
            }
        }

    }

    class LinkedList {
        char c;
        LinkedList next;
        LinkedList prev;

        LinkedList(char i) {
            c = i;
            next = this;
            prev = this;
        }

        public char getC() {
            return c;
        }


        public void setNext(LinkedList next) {
            this.next = next;
        }

        public void setPrev(LinkedList prev) {
            this.prev = prev;
        }

        public LinkedList getNext() {
            return next;
        }

        public LinkedList getPrev() {
            return prev;
        }

        public LinkedList add(LinkedList i) {
            i.setNext(this.next);
            this.next = i;
            i.getNext().setPrev(i);
            i.setPrev(this);
            return this.next;
        }

        public LinkedList delete() {
            this.next.setPrev(this.prev);
            this.prev.setNext(this.next);
            return this.next;
        }
    }

}