#include <bits/stdc++.h>
using namespace std;
template <typename T>
T modpow(T base, T exp, T modulus) {
  base %= modulus;
  T result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result * base) % modulus;
    base = (base * base) % modulus;
    exp >>= 1;
  }
  return result;
}
bool sortbysec(const array<long long, 3> &a, const array<long long, 3> &b) {
  if (a[1] == b[1]) return a[2] < b[2];
  return a[1] > b[1];
}
struct c_h {
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    x ^= FIXED_RANDOM;
    return x ^ (x >> 16);
  }
};
template <typename T>
T calcpow(T x, T y) {
  T temp;
  if (y == 0) return 1;
  temp = calcpow(x, y / 2);
  if (y % 2 == 0)
    return temp * temp;
  else {
    if (y > 0)
      return x * temp * temp;
    else
      return (temp * temp) / x;
  }
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long egcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long x1;
  long long y1;
  long long g = egcd(b, a % b, x1, y1);
  x = y1;
  y = x1 - y1 * (a / b);
  return g;
}
bool isprime(long long a) {
  bool flag = 1;
  for (long long i = 2; i * i <= a; i++) {
    if (a % i == 0) {
      flag = 0;
      break;
    }
  }
  return flag;
}
long long dx[4] = {1, -1, 0, 0};
long long dy[4] = {0, 0, 1, -1};
int main() {
  string s;
  cin >> s;
  long long n = s.length();
  vector<string> v(26);
  for (long long i = 0; i < 26; i++) v[i] = (char)('a' + i);
  vector<string> c = v;
  vector<string> l3;
  for (long long i = 0;; i++) {
    string x = c[i];
    if (x.length() == 3) break;
    for (auto y : v) {
      c.push_back(x + y);
      if (x.length() == 2) l3.push_back(x + y);
    }
  }
  vector<string> ss(3);
  for (long long i = 0; i < 3; i++) {
    for (long long j = 0; j < n; j++) ss[i] += l3[j][i];
  }
  vector<string> t(3);
  for (long long i = 0; i < 3; i++) {
    cout << "? " << ss[i] << endl;
    cin >> t[i];
  }
  vector<long long> per(n);
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      bool p = 1;
      for (long long k = 0; k < 3; k++)
        if (ss[k][i] != t[k][j]) p = 0;
      if (p) per[j] = i;
    }
  }
  vector<char> ans(n);
  for (long long i = 0; i < n; i++) {
    ans[per[i]] = s[i];
  }
  cout << "! ";
  for (auto x : ans) cout << x;
  cout << endl;
  return 0;
}
