#include <bits/stdc++.h>
using namespace std;
struct IO {
  char buf[(1 << 20)], *p1, *p2;
  char pbuf[(1 << 20)], *pp;
  IO() : p1(buf), p2(buf), pp(pbuf) {}
  inline char gc() {
    return getchar();
    if (p1 == p2) p2 = (p1 = buf) + fread(buf, 1, (1 << 20), stdin);
    return p1 == p2 ? ' ' : *p1++;
  }
  inline bool blank(char ch) {
    return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
  }
  template <class T>
  inline void read(T &x) {
    register double tmp = 1;
    register bool sign = 0;
    x = 0;
    register char ch = gc();
    for (; !(ch >= '0' && ch <= '9'); ch = gc())
      if (ch == '-') sign = 1;
    for (; (ch >= '0' && ch <= '9'); ch = gc()) x = x * 10 + (ch - '0');
    if (ch == '.')
      for (ch = gc(); (ch >= '0' && ch <= '9'); ch = gc())
        tmp /= 10.0, x += tmp * (ch - '0');
    if (sign) x = -x;
  }
  inline void read(char *s) {
    register char ch = gc();
    for (; blank(ch); ch = gc())
      ;
    for (; !blank(ch); ch = gc()) *s++ = ch;
    *s = 0;
  }
  inline void read(char &c) {
    for (c = gc(); blank(c); c = gc())
      ;
  }
  template <class t>
  inline void write(t x) {
    if (x < 0)
      putchar('-'), write(-x);
    else {
      if (x > 9) write(x / 10);
      putchar('0' + x % 10);
    }
  }
} io;
const int mod = 1e9 + 7;
const int mo = 998244353;
const int N = 55;
unsigned long long f[N][N], fac[N], Ans;
int n, a[N];
char s[N];
int main() {
  scanf("%d%s", &n, s + 1);
  for (int i = (1); i <= (2 * n); i++) a[i] = s[i] ^ 48;
  fac[0] = 1;
  for (int i = (1); i <= (2 * n); i++) fac[i] = fac[i - 1] * 10;
  for (int i = (2 * n); i >= (1); i--)
    for (int j = (0); j <= (2 * n - i + 1); j++) {
      int k = (2 * n - i + 1) - j;
      if (j) f[i][j] = max(f[i][j], f[i + 1][j - 1] + fac[j - 1] * a[i]);
      if (k) f[i][j] = max(f[i][j], f[i + 1][j] + fac[k - 1] * a[i]);
    }
  Ans = f[1][n];
  int m = n, P = 1;
  for (;;) {
    if (f[P + 1][m - 1] + fac[m - 1] * a[P] == f[P][m] && m)
      putchar('H'), m--;
    else
      putchar('M');
    P++;
    if (P > 2 * n) break;
  }
  return 0;
}
