//Arayi
//#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cassert>
#include <chrono>
#include <random>
#include <complex>

#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int> 
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;

lli gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
ld dist(ld x, ld y1, ld x2, ld y2)
{
    return sqrt((x - x2) * (x - x2) + (y1 - y2) * (y1 - y2));
}
lli S(lli a)
{
    return (a * (a + 1LL)) / 2;
}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 1, -1, 0, 0, -1, -1, 1, 1, 0 };
int dy[] = { 0, 0, 1, -1, -1, 1, -1, 1, 0 };


const int N = 2e6 + 30;
const lli mod = 1e9 + 7;
const ld pi = acos(-1);
const int T = 238;
const ld e = 1e-13;

lli bp(lli a, lli b = mod - 2LL)
{
    lli ret = 1;
    while (b)
    {
        if (b & 1) ret *= a, ret %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ret;
}
ostream& operator<<(ostream& c, pir a)
{
    c << a.fr << " " << a.sc;
    return c;
}
struct pt
{
    lli x, y;
    int ind;
    int bl;
    bool operator==(const pt& a)
    {
        return ind == a.ind;
    }
    bool operator<(const pt& b)
    {
        if (x == b.x) return y < b.y;
        return x < b.x;
    }
};





int n, qan;
vector<char> fp;
vii ss;
str s;
map<string, int>mp;
int ask(str a)
{
    if (mp[a]) return mp[a] - 1;
    if (qan == 850)
    {
        while (true) int sm = 0;
    }
    qan++;
    cout << "? " << a << endl;
    int sm;
    cin >> sm;
    mp[a] = sm + 1;
    return sm;
}
bool bs(char A)
{
    int l = 0, r = s.length(), ans = -1;
    while (l <= r)
    {
        int mid = (l + r) / 2;
        str t = s.substr(0, mid);
        int i1 = mid;
        while (i1 < s.length())
        {
            if (s[i1] == A) t += A;
            i1++;
        }
        t += A;
        //cout << t << endl;
        if (ask(t) == n - (int)t.length()) ans = mid, l = mid + 1;
        else r = mid - 1;
    }
    if (ans == -1) return 0;
    s = s.substr(0, ans) + A + s.substr(ans, (int)s.length() - ans);
    return 1;
}
int main()
{
    fastio;
    for (int i = 0; i < 128; i++) s += "a";
    if (ask(s) == 128) n--;
    s = "a";
    n += ask(s) + 1;
    s = "";
    for (char i = 'a'; i <= 'z'; i++) fp.ad(i);
    for (char i = 'A'; i <= 'Z'; i++) fp.ad(i);
    for (char i = '0'; i <= '9'; i++) fp.ad(i);
    for (auto p : fp)
    {
        for (int i = 0; i < n; i++)
        {
            s += p;
        }
        ss.ad(n - ask(s));
        s = "";
    }
    ///for (auto p : ss) cout << p << " ";
    for (int i = 0; i < fp.size(); i++)
    {
        auto p = fp[i];
        for (int j = 0; j < ss[i]; j++) bs(p);  
    }
    cout << "! " << s << endl;
    return 0;
}

/*

  __
*(><)*
  \/ /
  ||/
--||
  ||
  /\
 /  \
/    \
*/

Measured memory_bytes: 3796