//
//  main.cpp
//  GeneralCompetitiveProgramming
//
//  Created by Ali AlSalman on 12/07/2023.
//

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <numeric>
#include <cmath>
#include <climits>

#define endl '\n'

using namespace std;

const pair<bool, __int128> Sim = {false, 993187646149241375};

int digitSum(long long n) {
    string ns = to_string(n);
    int ans = 0;
    for (char c : ns) ans += c - '0';
    return ans;
}

int query(long long n) {
    cout<<"query "<<n<<endl<<flush;
    
    int x = digitSum(Sim.second + n);
    if (!Sim.first) cin>>x;
    else cerr<<x<<endl;
    return x;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    
    
    int initDigitSum = query(0);
    string ans = "";
    for (long long digit = 1; digit < 1e18; digit *= 10) {
        int l = 1, r = 9, binans = 10;
        while (l <= r) {
            int mid = (l + r) / 2;
            int qmid = query((long long) mid * digit);
            if (initDigitSum < qmid) {
                l = mid + 1;
            } else {
                binans = mid;
                r = mid - 1;
            }
        }
        
        ans += to_string(10 - binans);
    }
    
    reverse(ans.begin(), ans.end());
    for (int i = 0; i < ans.size(); i++) {
        if (ans[i] != '0') { ans = ans.substr(i, ans.size() - i); break; }
    }
    cout<<"answer "<<ans<<endl;
    
    
    if (Sim.first) {
        for (long long digit = 1; digit < 1e18; digit *= 10) {
            cerr<<"digit: "<<log10(digit)<<endl;
            for (int i = 0; i < 10; i++) {
                cerr<<i<<": "<<digitSum(Sim.second + i * digit)<<endl;
            }
            cerr<<endl;
        }
    }
}