import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int Ask(int l, int r) {
  writefln("? %s %s", l + 1, r);
  stdout.flush;
  const res = readInt;
  return res;
}

void main() {
  const N = readInt;
  
  auto ss = new int[N + 1];
  ss[N] = N * (N + 1) / 2;
  ss[1] = ss[N] - Ask(1, N);
  foreach (k; 2 .. N) {
    ss[k] = Ask(0, k);
  }
  
  write("!");
  foreach (i; 0 .. N) {
    write(" ", ss[i + 1] - ss[i]);
  }
  writeln;
  stdout.flush;
}