#include <iostream>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
#include <queue>
#include <sstream>
#include <ctime>
#include <iterator>
#include <string.h>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <fstream>
#include <assert.h>
#include <numeric>
#include <complex>
#include <random>
#include <utility>



#define IOS ios_base::sync_with_stdio(0),cin.tie(0), cout.tie(0);
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,a,b) for(int i = (a) - 1; i>=(b);i--)
#define rep(i,n) FOR(i,0,n)
#define PB push_back
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define VI vector<int>
#define PII pair<int,int>
#define PLL pair<long long,long long>
#define VL vector<long long >
#define FILL(a, value) memset(a, value, sizeof(a))
const int nax = 2 * (int)1e5 + 147;
 
using namespace std;
 
const int MOD = 998244353;
const int INF = 1e9 +47 ;
const long long LINF = (long long)1e18 + 4747;
 
typedef long long LL;
const double EPS=1e-6;


int main() {
    int len = 0;
    cout << '?' << ' ';
    for(int i = 0;i < 26;i ++) {
        cout << (char)('a' + i);
    }
    cout << endl;
    int cc;
    cin >> cc;
    len = cc;
    
    for(int i = 0;i < cc;i ++ ) {
        int x;
        cin >> x;
    }
    vector<int >mask(5);
    vector<vector<int>>vec;
    vec.resize(5);
    for(int it = 0; it < 5;it ++ ) {
        int msk = 0;
        cout << '?' << ' ';
        for(int j =0 ;j < 26;j ++ )
        {
            if(j & (1 << it)){
                msk|=(1 << j);
                cout << (char)('a' + j);
            }
        }
        cout << endl;
        int cc;
        cin >> cc;
        for(int i =0 ;i <cc;i ++ ) {
            int x;
            cin >> x;
            --x;
            vec[it].push_back(x);
        }
        mask[it] = msk;
    }
    string ans(len,'a');
    for(int i =1 ;i < 26;i ++ ) {
        set<int > s;
        for(int it =0;it < 5;it ++ ) {
            if(mask[it] & (1 << i)) {
                for(int j =0 ;j < vec[it].size();j++) {
                    s.insert(vec[it][j]);
                }
                break;
            }
        }
        for(int it =0;it <5;it++) {
            if(mask[it] & ( 1 << i )) {
                set<int> t ;
                
                for(int j =0;j < vec[it].size();j ++ ) {
                    t.insert(vec[it][j]);
                }
                vector<int> to_del;
                for(auto x : s)
                {
                    if(!t.count(x))to_del.push_back(x);
                }
                for(auto x : to_del) {
                    s.erase(x);
                }
            }
            else {
                for(int j = 0;j < vec[it].size();j ++ ) {
                    s.erase(vec[it][j]);
                }
            }
        }
        for(auto x : s) {
            ans[x] = (char)('a' + i);
        }
    }
    cout << '!' << ' ' << ans << endl;
}