#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 7, MAXN = 1e6 + 7, INF = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
long long fpow(long long a, long long b, long long p) {
  long long ans = 1LL;
  while (b) {
    if (b & 1) ans = ans * a % p;
    b >>= 1;
    a = a * a % p;
  }
  return ans % p;
}
int n;
map<string, int> map1[105], map2[105];
void solve() {
  cin >> n;
  if (n == 1) {
    cout << "? 1 1" << endl;
    string s;
    cin >> s;
    cout << "! " << s << endl;
    return;
  }
  cout << "? 1 " << n << endl;
  for (int i = 0; i < n * (n + 1) / 2; i++) {
    string s;
    cin >> s;
    sort(s.begin(), s.end());
    int len = s.size();
    map1[len][s]++;
  }
  cout << "? 2 " << n << endl;
  for (int i = 0; i < n * (n - 1) / 2; i++) {
    string s;
    cin >> s;
    sort(s.begin(), s.end());
    int len = s.size();
    map2[len][s]++;
  }
  string ans = "";
  for (int i = 1; i <= n; i++) {
    for (auto p2 : map2[i]) {
      map1[i][p2.first] -= p2.second;
    }
    string tmp;
    for (auto p1 : map1[i]) {
      if (map1[i][p1.first] > 0) {
        tmp = p1.first;
      }
    }
    int cnt1[26], cnt2[26];
    memset(cnt1, 0, sizeof(cnt1));
    memset(cnt2, 0, sizeof(cnt2));
    for (auto it : ans) cnt1[it - 'a']++;
    for (auto it : tmp) cnt2[it - 'a']++;
    for (int i = 0; i < 26; i++) {
      cnt2[i] -= cnt1[i];
      if (cnt2[i] > 0) {
        ans += 'a' + i;
        break;
      }
    }
  }
  cout << "! " << ans << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int T = 1;
  while (T--) solve();
  return 0;
}
