Problem: This is an interactive problem. Remember to flush your output while communicating with the testing program. You may use fflush(stdout) in C++, system.out.flush() in Java, stdout.flush() in Python or flush(output) in Pascal to flush the output. If you use some other programming language, consult its documentation. You may also refer to the guide on interactive problems: <https://codeforces.com/blog/entry/45307>.

You are given a string t consisting of n lowercase Latin letters. This string was cyphered as follows: initially, the jury had a string s consisting of n lowercase Latin letters. Then they applied a sequence of no more than n (possibly zero) operations. i-th operation is denoted by two integers a_i and b_i (1 ≤ a_i, b_i ≤ n), and means swapping two elements of the string with indices a_i and b_i. All operations were done in the order they were placed in the sequence. For example, if s is xyz and 2 following operations are performed: a_1 = 1, b_1 = 2; a_2 = 2, b_2 = 3, then after the first operation the current string is yxz, and after the second operation the current string is yzx, so t is yzx.

You are asked to restore the original string s. Unfortunately, you have no information about the operations used in the algorithm (you don't even know if there were any operations in the sequence). But you may run the same sequence of operations on any string you want, provided that it contains only lowercase Latin letters and its length is n, and get the resulting string after those operations.

Can you guess the original string s asking the testing system to run the sequence of swaps no more than 3 times?

The string s and the sequence of swaps are fixed in each test; the interactor doesn't try to adapt the test to your solution.

Input

Initially the testing system sends one string t, consisting of lowercase Latin letters (1 ≤ |t| = n ≤ 10^4).

Output

To give the answer, your program should print one line ! s with a line break in the end. After that, it should flush the output and terminate gracefully.

Interaction

Before giving the answer, you may submit no more than 3 queries. To ask a query, print one line in the following format: ? s', where s' should be a string consisting of exaclty n lowercase Latin letters. The line should be ended with a line break character. After submitting a query, flush the output and read the answer to your query — a string t' consisting of n lowercase Latin letters, which is the result of applying the sequence of swaps to string s'. This string will be given on a separate line ended by a line break character.

If you submit an incorrect query (or ask more than 3 queries), the answer to it will be one string 0. After receiving such an answer, your program should terminate immediately — otherwise you may receive verdict "Runtime error", "Time limit exceeded" or some other verdict instead of "Wrong answer".

Example

Input


yzx
aab
baa
aba

Output


? baa
? aba
? aab
! xyz

Note

In the sample, the testcase described in the statement is used. The participant asks the first query with string baa, which is transformed to aab. The second query contains string aba, which is transformed to baa. The third query contains string aab, which is transformed to aba. The participant can deduce that the initial string s was xyz.

Note for hacking phase:

To submit a test in hacking phase, you should provide it in the following format:

The first line should contain the string s you guess, consisting of n ∈ [1, 10000] lowercase Latin letters.

The second line should contain k (0 ≤ k ≤ n) — the number of swap operations in the sequence.

Then k lines should follow, i-th of them should denote i-th operation with two integers a_i and b_i (1 ≤ a_i, b_i ≤ n).

For example, the sample test would look like that:

xyz

2

1 2

2 3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long linf = 0x3f3f3f3f3f3f3f;
const double eps = 1e-6;
const double pi = 3.14159265358979;
const int maxn = 1e5 + 5;
const int maxm = 2e7 + 5;
const int mod = 1e9 + 7;
int n, rev[maxn], t[maxn];
char s[maxn], tmp[4][maxn];
int mul_inv(int a, int b) {
  int b0 = b, t, q;
  int x0 = 0, x1 = 1;
  if (b == 1) return 1;
  while (a > 1) {
    q = a / b;
    t = b;
    b = a % b;
    a = t;
    t = x0;
    x0 = x1 - q * x0;
    x1 = t;
  }
  if (x1 < 0) x1 += b0;
  return x1;
}
int chinese_remainder(vector<int> a, vector<int> b, int n) {
  int p, prod = 1, sum = 0;
  for (int i = 0; i < n; ++i) prod *= b[i];
  for (int i = 0; i < n; ++i) {
    p = prod / b[i];
    sum += a[i] * mul_inv(p, b[i]) * p;
  }
  return sum % prod;
}
int main() {
  scanf("%s", s);
  int n = strlen(s);
  for (int m = 26, j = 0; m >= 23; --m, j = 0) {
    if (m == 24) continue;
    for (int i = 0; i < n; ++i) {
      tmp[26 - m][i] = (char)('a' + j);
      ++j;
      j %= m;
    }
  }
  for (int i = 0; i <= 3; ++i) {
    if (i == 2) continue;
    printf("? %s\n", tmp[i]);
    fflush(stdout);
    scanf("%s", tmp[i]);
  }
  for (int i = 0; i < n; ++i)
    t[i] = chinese_remainder(
        vector<int>{tmp[0][i] - 'a', tmp[1][i] - 'a', tmp[3][i] - 'a'},
        vector<int>{26, 25, 23}, 3);
  for (int i = 0; i < n; ++i) rev[t[i]] = i;
  printf("! ");
  for (int i = 0; i < n; ++i) printf("%c", s[rev[i]]);
  return 0;
}