//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define trav(x,a) for (const auto& x: a)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), x.end()
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int _i = 0; _i < (n); _i++) ni(a[_i])
#define nal(a, n) for (int _i = 0; _i < (n); _i++) nl(a[_i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
const int N = 1e6 + 5;
const double eps = 1e-9;
vector<char> sig;
int freq[N];

// int edit(string ans, string s) {
//   vector<vector<int>> dp(sz(ans)+1);
//   for (int i = 0; i <= sz(ans); i++) {
//     dp[i].resize(sz(s)+1);
//     fill(all(dp[i]), 0);
//   }
//   for (int i = 0; i <= sz(ans); i++)
//     dp[i][0] = i;
//   for (int i = 0; i <= sz(s); i++)
//     dp[0][i] = i;
//   for (int i = 1; i <= sz(ans); i++) {
//     for (int j = 1; j <= sz(s); j++) {
//       dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + 1;
//       dp[i][j] = min(dp[i][j], dp[i-1][j-1] + (ans[i-1] != s[j-1]));
//     }
//   }
//   return dp[sz(ans)][sz(s)];
// }

// string ans = "";
// int qcnt = 0;

int ask(const string& s) {
  cout << "? " << s << endl;
  // qcnt++;
  // {
  //   return edit(ans, s);
  // }
  int ret; cin >> ret;
  return ret;
}

int findLen() {
  int mn = inf, mx = -1;
  for (char c: sig) {
    int l = ask(string(1, c));
    mn = min(mn, l);
    mx = max(mx, l);
  }
  return mx + (mx == mn);
}

int len;

void findFreq() {
  for (int i = 0; i < sz(sig); i++)
    freq[i] = len - ask(string(len, sig[i]));
}

string merge(const string& s, const string& t) {
  if (!sz(s) || !sz(t)) return !sz(s) ? t : s;
  string ret = "";
  int i = 0, j = 0;
  while (i < sz(s) && j < sz(t)) {
    string x = ret + t[j] + s.substr(i, sz(s)-i);
    if (ask(x) == len - sz(x))
      ret.push_back(t[j]), j++;
    else
      ret.push_back(s[i]), i++;
  }
  if (i == sz(s))
    ret += t.substr(j, sz(t)-j);
  if (j == sz(t))
    ret += s.substr(i, sz(s)-i);
  return ret;
}

string merge(int l, int r) {
  int sm = 0;
  for (int i = l; i <= r; i++)
    sm += freq[i];
  if (!sm) return "";
  int nx = freq[l];
  for (int i = l+1; i <= r; i++) {
    if ((nx + freq[i]) * 2 > sm)
      return merge(merge(l, i-1), merge(i, r));
    nx += freq[i];
  }
  return string(freq[l], sig[l]);
}

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  for (int i = 0; i < 26; i++)
    sig.push_back('A' + i), sig.push_back('a' + i);
  for (int i = 0; i < 10; i++)
    sig.push_back('0' + i);
  len = findLen();
  findFreq();
  string sol = merge(0, sz(sig)-1);
  cout << "! " << sol << endl;
  return 0;
}


Measured memory_bytes: 3776