#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for (int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for (int (i) = (a) - 1; (i) >= (b); (i)--)
#define PI acos(-1.0)
#define DEBUG(C) cout<< C <<endl;
#define VI vector <int>
#define VII vector <VI>
#define VL vector <LL>
#define VLL vector <VL>
#define VD vector <double>
#define VDD vector <VD>
#define PII pair <int, int>
#define PDD pair <double, double>
#define PLL pair <LL, LL>
#define VPII vector <PII>
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define EB emplace_back
#define FORE(a, b) for (auto &&a:b)
#define FIND(s, n) (s.find(n) != s.end())

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF = 1e9;
const int MOD = INF + 7;

string cc[2];

int main(void) {
    cc[0] = "..##";
    cc[1] = ".#.#";
    set <vector <string>> nai;
    int N; cin >> N;
    vector <string> S(2, ""), Sbuf(2);
    int cnt = 0;
    S[0] += cc[0][0];
    S[1] += cc[1][0];
    bool f = false;
    REP(_, 420) {
        printf("%s\n%s\n", S[0].c_str(), S[1].c_str());
        string c; cin >> c;
        if (c == "T") {
            Sbuf = S;
            cnt = 0;
            REP(i, 2) {
                S[i] += cc[i][cnt];
            }
        } else if (c == "F") {
            nai.insert(S);
            label:
            S = Sbuf;
            cnt++;
            if (cnt >= 4 || f) {
                f = true;
                REP(i, 2) {
                    S[i] = cc[i][cnt % 4] + S[i];
                }
            } else {
                REP(i, 2) {
                    S[i] += cc[i][cnt % 4];
                }
            }
            if (FIND(nai, S)) {
                goto label;
            }
        } else {
            break;
        }
    }
}
