#include <bits/stdc++.h>
using namespace std;
using pii = pair<long long, long long>;
using vi = vector<long long>;
using vvi = vector<vi>;
const signed INF_ = 1001001001;
const long long INF = 1001001001001001001LL;
const long long DX[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0},
                DY[9] = {-1, 0, 1, 0, -1, 1, 1, -1, 0};
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++)
    os << *i << (i == end(v) - 1 ? "" : " ");
  return os;
}
template <class T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) is >> *i;
  return is;
}
template <class T, class U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <class T, class U>
bool chmax(T &a, const U &b) {
  return a < b ? a = b, 1 : 0;
}
template <class T, class U>
bool chmin(T &a, const U &b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
void psum(T &c) {
  partial_sum(begin(c), end(c), begin(c));
}
template <class T>
using heap = priority_queue<T, vector<T>, greater<T>>;
struct before_main_function {
  before_main_function() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    cout << setprecision(15) << fixed;
  }
} before_main_function;
string ask(string s) {
  cout << "? " << s << endl;
  string r;
  cin >> r;
  return r;
}
signed main() {
  string T;
  cin >> T;
  long long n = ((long long)T.size());
  vector<long long> P(n);
  for (long long i = 0, ilen = (long long)(n); i < ilen; ++i) {
    P[i] = i;
  }
  string res[3];
  for (long long k = 0, klen = (long long)(3); k < klen; ++k) {
    string tmp;
    for (long long i = 0, ilen = (long long)(n); i < ilen; ++i) {
      long long idx = P[i];
      for (long long m = 0, mlen = (long long)(k); m < mlen; ++m) {
        idx /= 26;
      }
      idx %= 26;
      tmp += idx + 'a';
    }
    res[k] = ask(tmp);
  }
  string ans = T;
  for (long long i = 0, ilen = (long long)(n); i < ilen; ++i) {
    long long pos = (res[2][i] - 'a') * 26 * 26 + (res[1][i] - 'a') * 26 +
                    (res[0][i] - 'a');
    ans[pos] = T[i];
  }
  cout << "! " << ans << endl;
  return (0 ^ 0 ^ 0);
}
