// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

/*
megnézünk ilyen szegmenseket (egybefüggő különböző sorozatot) és az a megoldás+1
*/

int main() {
    int n; cin >> n;

    vector<bool> basic(n);

    vector<bool> outcome(n);

    string cucc;

    cin >> cucc;
    for (int i = 0; i < n; i++) {
        if (cucc[i] == 'S') {
            basic[i] = true;
        } else {
            basic[i] = false;
        }
    }

    cin >> cucc;
    for (int i = 0; i < n; i++) {
        if (cucc[i] == 'S') {
            outcome[i] = true;
        } else {
            outcome[i] = false;
        }
    }

    for (int i = 0; i < n; i++) {
        if (basic[i]) {
            cout << "igaz ";
        } else {
            cout << "hamis ";
        }
    }
    cout << endl;

    for (int i = 0; i < n; i++) {
        if (outcome[i]) {
            cout << "igaz ";
        } else {
            cout << "hamis ";
        }
    }
    cout << endl;
}