/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author majk
 */

#ifndef MAJK_LIB
#define MAJK_LIB

#include <vector>
#include <stack>
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <array>
#include <bitset>
using namespace std;

#define x first
#define y second
typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.x << ' ' << p.y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
ui logceil(ll x) { return x?8*sizeof(ll)-__builtin_clzll(x):0; }

namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename F> double bshd(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){l=m;}else{h=m;}}return (l+h)/2;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename F> double bsld(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){h=m;}else{l=m;}}return (l+h)/2;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }


template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};


#endif

constexpr int L = 128;
constexpr int Q = 850;
constexpr int M = 62;
string S = "QWERTYUIOPASDFGHJKLZXCVBNMqwertyuiopasdfghjklzxcvbnm1234567890";
string hidden = "987iuhdsfiw7yishdfiuwyhfiou98uIOUHIUHIFYUHFISDHFIH";

class DGuessThePassword {
public:
    string Ans;
    int N;
    vector<int> C;

    int dist(string A, string B) {
        int a = A.size(), b = B.size();
        vector2<int> D(a+1, b+1, a+b+2);
        D[0][0] = 0;
        for (int i = 0; i <= a; ++i) {
            for (int j = 0; j <= b; ++j) {
                if (i != a && j != b && A[i] == B[j]) D[i+1][j+1] = min(D[i+1][j+1], D[i][j]);
                if (i != a) D[i+1][j] = min(D[i+1][j], D[i][j]+1);
                if (j != b) D[i][j+1] = min(D[i][j+1], D[i][j]+1);
                if (i != a && j != b) D[i+1][j+1] = min(D[i+1][j+1], D[i][j]+1);
            }
        }
        return D[a][b];
    }

    int query(istream& cin, ostream& cout, string S) {
//        return dist(S, hidden);
        cout << "? " << S << endl;
        int q; cin >> q; return q;
    }

    void binsearch(istream&cin, ostream&cout, int l, int r, int have, char c) {
        if (l == r) return;
        if (have == 0) return;

        vector<int> Pos;
        int free = 0;
        for (int i = l; i < r; ++i) {
            if (Ans[i] == '-') Pos.push_back(i);
        }
        if (Pos.size() == have) {
            // no need to query
            for (int i = l; i < r; ++i) {
                if (Ans[i] == '-') Ans[i] = c;
            }
        } else {
            string Q(N, S[0]);
            int mid = Pos[(Pos.size()-1)/2];
            for (int i = l; i <= mid; ++i) {
                if (Ans[i] == '-') Q[i] = c;
            }
            int q = query(cin, cout, Q);
            int good = N - q - C[0];
            binsearch(cin, cout, l, mid+1, good, c);
            binsearch(cin, cout, mid+1, r, have - good, c);
        }
    }

    void solve(istream& cin, ostream& cout) {
        C.resize(M);
        for (int i = 0; i < M; ++i) {
            C[i] = L - query(cin, cout, string(L, S[i]));
        }

        N = 0;
        for (int i = 0; i < M; ++i) N += C[i];

        Ans = string(N, '-');
        for (int i = 0; i < N; ++i) {
            string Q(N, S[1]);
            Q[i] = S[0];
            int s = query(cin, cout, Q);
            if (N - s == C[1] + 1) Ans[i] = S[0];
        }

        for (int i = 1; i < M; ++i) {
            binsearch(cin, cout, 0, N, C[i], S[i]);
        }
//
        cout << "! " << Ans << endl;
    }
};



int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	DGuessThePassword solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
    return 0;
}



Measured memory_bytes: 3780