//
//  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;

int query(long long n) {
    cout<<"query "<<n<<endl<<flush;
    
    int x;
    cin>>x;
    return x;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    
    
    int initDigitSum = query(0);
    string ans = "";
    for (int digit = 0; digit < 18; digit++) {
        if (query(9 * pow(10, digit)) != initDigitSum) {
            ans += '0';
            continue;
        }
        
        int l = 1, r = 9, binans = -1;
        while (l <= r) {
            int mid = (l + r) / 2;
            int qmid = query((long long) mid * pow(10, 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);
    }
    cout<<"answer "<<ans<<endl;
    
    
}