#include <bits/stdc++.h>
using namespace std;
const long double EPS = (long double)1e-7;
const long double PI = acos(0) * 2;
bool isZero(const long double& x) { return abs(x) <= EPS; }
int sign(const long double& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
long long gcd(long long a, long long b) {
  for (; b; a %= b, swap(a, b)) {
  }
  return abs(a);
}
pair<long long, long long> operator+(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first + b.first, a.second + b.second);
}
pair<long long, long long> operator-(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first - b.first, a.second - b.second);
}
pair<long long, long long> operator*(const pair<long long, long long>& a,
                                     const long long& b) {
  return pair<long long, long long>(a.first * b, a.second * b);
}
long long operator*(const pair<long long, long long>& a,
                    const pair<long long, long long>& b) {
  return a.first * b.second - b.first * a.second;
}
long long ccw(const pair<long long, long long>& a,
              const pair<long long, long long>& b,
              const pair<long long, long long>& c) {
  return a * b + b * c + c * a;
}
void fg(vector<int> G[], int a, int b) {
  G[a].emplace_back(b);
  G[b].emplace_back(a);
}
void fg(vector<pair<int, int> > G[], int a, int b, int c) {
  G[a].emplace_back(b, c);
  G[b].emplace_back(a, c);
}
vector<string> A[105], B[105], C[105];
char Ans[105];
char StartKey;
int N;
int main() {
  scanf("%d", &N);
  if (1 == N) {
    printf("? 1 1\n");
    fflush(stdout);
    char tmp[5];
    scanf(" %s", tmp);
    printf("! %s\n", tmp);
    fflush(stdout);
    exit(0);
  }
  printf("? 1 %d\n", N);
  fflush(stdout);
  for (int t = N * (N + 1) / 2; t--;) {
    char str[105];
    scanf(" %s", str);
    string S(str);
    A[((int)(S).size())].emplace_back(S);
  }
  printf("? 1 1\n");
  fflush(stdout);
  {
    char str[55];
    scanf(" %s", str);
    StartKey = str[0];
    B[1].emplace_back(string(str));
  }
  printf("? 2 %d\n", N);
  fflush(stdout);
  for (int t = (N - 1) * N / 2; t--;) {
    char str[105];
    scanf(" %s", str);
    string S(str);
    C[((int)(S).size())].emplace_back(S);
  }
  Ans[1] = StartKey;
  multiset<string> G[105];
  for (int i = 2; i <= N; i++) {
    for (auto& v : A[i]) sort(((v).begin()), ((v).end()));
    for (auto& v : C[i]) sort(((v).begin()), ((v).end()));
    for (auto& v : A[i]) G[i].insert(v);
    for (auto& v : C[i]) G[i].erase(G[i].find(v));
  }
  for (int i = 2; i <= N; i++) {
    int cnt[55] = {
        0,
    };
    for (int j = 1; j < i; j++) cnt[Ans[j] - 'a']++;
    auto S = *G[i].begin();
    for (int j = 0; j < i; j++) cnt[S[j] - 'a']--;
    for (int j = 'a'; j <= 'z'; j++) {
      if (cnt[j - 'a']) Ans[i] = j;
    }
  }
  printf("! %s\n", Ans + 1);
  return 0;
}
