using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {

    string ans = null;

    public static int EditDistance(string A, string B, int add = 1, int delete = 1, int change = 1) {
        return EditDistance(A.ToCharArray(), B.ToCharArray(), add, delete, change);
    }

    public static int EditDistance<T>(T[] A, T[] B, int add = 1, int delete = 1, int change = 1) where T : IEquatable<T> {
        int n = A.Length;
        int m = B.Length;
        int[,] dp = new int[n + 1, m + 1];
        for (int i = 0; i <= n; i++) {
            dp[i, 0] = i * delete;
        }

        for (int i = 0; i <= m; i++) {
            dp[0, i] = i * add;
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                dp[i + 1, j + 1] = Math.Min(
                    Math.Min(dp[i, j + 1] + delete, dp[i + 1, j] + add),
                    dp[i, j] + (A[i].Equals(B[j]) ? 0 : change)
                );
            }
        }
        return dp[n, m];
    }
    int count = 0;
    int Query(string s) {
        count++;
        if (!string.IsNullOrEmpty(ans)) {
            var res = EditDistance(ans, s);
            //Console.Error.WriteLine("{0} {1}", s, res);
            return res;
        } else {
            cout.WriteLine($"? {s}");
            cout.Flush();
            return ni();
        }
    }
    void Submit(string s) {
        cout.WriteLine($"! {s}");
        cout.Flush();
    }

    public void Run() {
#if LOCAL
        ans = ns();
#endif
        var Q = 850;
        var s = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";

        var hist = new int[s.Length];

        int L = 0;

        for (int i = 0; i < s.Length; i++) {
            var res2 = Query(new string(s[i], 128));
            var num = 128 - res2;
            hist[i] = num;
            L += num;
        }

        var pq = new PriorityQueue<string>((s1, s2) => s1.Length.CompareTo(s2.Length));

        for (int i = 0; i < s.Length; i++) {
            if (hist[i] > 0) {
                pq.Enqueue(new string(s[i], hist[i]));
            }
        }

        while (pq.Count > 1) {
            pq.Enqueue(Merge(L, pq.Dequeue(), pq.Dequeue()));
        }

        Submit(pq.Peek());
        cerr.WriteLine(count);
    }

    public class PriorityQueue<T> {
        private T[] _array = new T[128];
        private int _size = 0;
        private readonly Comparison<T> _compare;

        public PriorityQueue() {
            _compare = Comparer<T>.Default.Compare;
        }

        public PriorityQueue(Comparison<T> comp) {
            _compare = comp;
        }

        public int Count { get { return _size; } }

        private void Swap(int a, int b) {
            var t = _array[a];
            _array[a] = _array[b];
            _array[b] = t;
        }

        private void Expand() {
            var newlist = new T[_array.Length << 1];
            Array.Copy(_array, newlist, _array.Length);
            _array = newlist;
        }

        public bool Any() {
            return _size > 0;
        }

        public void Enqueue(T newValue) {
            int pos = ++_size;
            if (_size >= _array.Length) {
                Expand();
            }
            _array[pos] = newValue;
            while (pos > 1) {
                int parent = pos >> 1;
                if (_compare(_array[parent], _array[pos]) > 0) {
                    Swap(parent, pos);
                    pos = parent;
                } else {
                    break;
                }
            }
        }

        public T Peek() {
            return _array[1];
        }

        public T Dequeue() {
            var top = _array[1];
            int pos = 1;
            _array[pos] = _array[_size--];
            while ((pos << 1) <= _size) {
                int left = pos << 1;
                int right = left | 1;
                int next = left;
                if (right <= _size && _compare(_array[left], _array[right]) > 0) {
                    next = right;
                }
                if (_compare(_array[pos], _array[next]) > 0) {
                    Swap(next, pos);
                    pos = next;
                } else {
                    break;
                }
            }

            return top;
        }
    };
    private string Merge(int L, string v1, string v2) {
        if (v1.Length > v2.Length) (v1, v2) = (v2, v1);
        int pos = 0;
        var merged = v1;
        foreach (var c in v2) {
            while (true) {
                var after = merged.Insert(pos, "" + c);
                var res = Query(after) - (L - after.Length);
                if (res == 0) {
                    merged = after;
                    pos++;
                    break;
                } else {
                    pos++;
                }
            }
        }
        return merged;
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}

Measured memory_bytes: 26144