#include <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
using ll = long long;
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
  os << "[ ";
  for (auto e : v) os << e << " ";
  return os << "]";
}
template <typename T, typename V>
ostream& operator<<(ostream& os, set<T, V> v) {
  os << "{ ";
  for (auto e : v) os << e << " ";
  return os << "}";
}
template <typename T, typename V, typename S>
ostream& operator<<(ostream& os, map<T, V, S> v) {
  os << "{ ";
  for (auto e : v) os << e << " ";
  return os << "}";
}
template <typename T, typename V>
ostream& operator<<(ostream& os, pair<T, V> x) {
  return os << "( " << x.first << ", " << x.second << " )";
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& e : v) is >> e;
  return is;
}
template <typename T, typename V>
istream& operator>>(istream& is, pair<T, V>& x) {
  return is >> x.first >> x.second;
}
template <typename T>
T divfloor(T a, T b) {
  assert(b != 0);
  if (a >= 0 && b > 0 || a <= 0 && b < 0) return a / b;
  return (a % b == 0) ? a / b : a / b - 1;
}
template <typename T>
T divceil(T a, T b) {
  assert(b != 0);
  if (a >= 0 && b > 0 || a <= 0 && b < 0)
    return (a % b == 0) ? a / b : a / b + 1;
  return a / b;
}
void solve();
int main() { solve(); }
void solve() {
  const int ALPHA_SIZE = 26;
  string t;
  cin >> t;
  int n = t.size();
  vector<vector<int>> p1(ALPHA_SIZE);
  string s1(n, '$');
  for (int i = 0; i < n; ++i) {
    s1[i] = 'a' + ((i / ALPHA_SIZE) % ALPHA_SIZE);
  }
  cout << "? " << s1 << "\n";
  cout.flush();
  string r1;
  cin >> r1;
  for (int i = 0; i < ALPHA_SIZE; ++i) {
    for (int j = 0; j < n; ++j) {
      if (r1[j] == 'a' + i) {
        p1[i].push_back(j);
      }
    }
  }
  string s2(n, '$');
  for (int i = 0; i < n; ++i) {
    s2[i] = 'a' + (i % ALPHA_SIZE);
  }
  cout << "? " << s2 << "\n";
  cout.flush();
  string r2;
  cin >> r2;
  vector<vector<int>> p2(n);
  for (int i = 0; i < n; ++i) {
    for (int j : p1[s1[i] - 'a']) {
      if (r2[j] == s2[i]) {
        p2[i].push_back(j);
      }
    }
  }
  string s3(n, '$');
  for (int i = 0; i < n; ++i) {
    s3[i] = 'a' + (i / (ALPHA_SIZE * ALPHA_SIZE) + i / ALPHA_SIZE) % ALPHA_SIZE;
  }
  cout << "? " << s3 << "\n";
  cout.flush();
  string r3;
  cin >> r3;
  vector<int> p(n, -1);
  for (int i = 0; i < n; ++i) {
    for (int j : p2[i]) {
      if (r3[j] == s3[i]) {
        p[i] = j;
      }
    }
  }
  string ans(n, '$');
  for (int i = 0; i < n; ++i) {
    ans[i] = t[p[i]];
  }
  cout << "! " << ans << "\n";
  cout.flush();
}
