#include<bits/stdc++.h>
using namespace std;

using ll = long long;

#define TYPE_OF( VAR ) remove_const<remove_reference<decltype( VAR )>::type >::type
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr ) 
#define CEXPR( LL , BOUND , VALUE ) constexpr const LL BOUND = VALUE 
#define CIN( LL , A ) LL A; cin >> A 
#define ASSERT( A , MIN , MAX ) assert( MIN <= A && A <= MAX ) 
#define CIN_ASSERT( A , MIN , MAX ) CIN( TYPE_OF( MAX ) , A ); ASSERT( A , MIN , MAX ) 
#define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( TYPE_OF( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) 
#define FOREQ( VAR , INITIAL , FINAL ) for( TYPE_OF( FINAL ) VAR = INITIAL ; VAR <= FINAL ; VAR ++ ) 
#define FOREQINV( VAR , INITIAL , FINAL ) for( TYPE_OF( INITIAL ) VAR = INITIAL ; VAR >= FINAL ; VAR -- ) 
#define QUIT return 0 
#define RETURN( ANSWER ) cout << ( ANSWER ) << "\n"; QUIT 

int main()
{
  CEXPR( int , bound_N , 1000 );
  CIN_ASSERT( N , 3 , bound_N );
  int total_sum = ( N * ( N + 1 ) ) / 2;
  int answer[bound_N + 1];
  FOR( i , 2 , N ){
    cout << "? " << 1 << " " << i << endl;
    CIN_ASSERT( sum , 3 , total_sum );
    answer[i] = sum;
  }
  cout << "? " << 2 << " " << N << endl;
  CIN_ASSERT( sum , 3 , total_sum );
 answer[1] = total_sum - sum;
  answer[N] = total_sum - answer[N-1];
  FOREQINV( i , N - 1 , 2 ){
    answer[i] -= answer[i-1];
  }
  cout << "! " << answer[1];
  FOREQ( i , 2 , N ){
    cout << " " << answer[i];
  }
  RETURN( "" );
}