# oj t -c "python3 main.py"
import sys,math
from collections import defaultdict,deque
from itertools import combinations,permutations,accumulate,product
from bisect import bisect_left,bisect_right
from heapq import heappop,heappush,heapify
#from more_itertools import distinct_permutations,distinct_combinations
#from sortedcontainers import SortedList,SortedSet
def input():return sys.stdin.readline().rstrip()
def ii(): return int(input())
def ms(): return map(int, input().split())
def li(): return list(map(int,input().split()))
inf = pow(10,18)
mod = 998244353
#/////////////////////////////////
A = input()
used = set()
alp = "abcdefghijklmnopqrstuvwxyz"
a = A
while True:
    S = a + A
    used.add(S)
    print("?",S,flush=True)
    f,a = input().split()
    if f=="!": exit()
    a = a[1]