#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long infll = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;
const int maxn = 100 + 10;
map<string, int> mp1[maxn];
map<string, int> mp2[maxn];
string ans;
int num[300];
char addans(string t) {
  memset(num, 0, sizeof(num));
  for (const char &ch : t) num[ch]++;
  for (const char &ch : ans) num[ch]--;
  for (char i = 'a'; i <= 'z'; ++i)
    if (num[i]) return i;
}
int main() {
  int n;
  cin >> n;
  if (n == 1) {
    cout << "? 1 1" << endl;
    string a;
    cin >> a;
    cout << "! " << a << endl;
    return 0;
  }
  cout << "? 1 " << n << endl;
  string t;
  int tot = ((n + 1) * n) / 2;
  for (int i = 1; i <= tot; ++i) {
    cin >> t;
    sort(t.begin(), t.end());
    mp1[t.size()][t]++;
  }
  cout << "? 2 " << n << endl;
  tot = (n * (n - 1)) / 2;
  for (int i = 1; i <= tot; ++i) {
    cin >> t;
    sort(t.begin(), t.end());
    mp2[t.size()][t]++;
  }
  for (int len = 1; len <= n; ++len) {
    for (auto p : mp2[len]) mp1[len][p.first] -= p.second;
    for (auto p : mp1[len])
      if (p.second > 0) ans += addans(p.first);
  }
  cout << "! " << ans << endl;
  return 0;
}
