#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;

int main(){

    int x0=100;
    cout<<"? "<<x0<<endl;
    int a0,a1;
    cin>>a0;

    int x1=100-a0-1;
    cout<<"? "<<x1<<endl;
    cin>>a1;//f(100-a0-1)=B-1

    int A,B;
    if(a0==99){
        A=99;
        B=100;

    }else{

        B=(a1+1)%100;
        for(int a=0;a<=100;a++){
            /*
            if((x1+a)%B==B-1){
                A=a;
                break;
            }
            */
            if((x0+a)%B==a0){
                A=a;
                break;
            }
        }



    }
     cout<<"! "<<A<<' '<<B<<endl;


}