#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1e8;
int main(){
	int n;
	cin>>n;
	string a="",b="";
	char c[2][2]={".","#"};
	while(1){
		bool h=false;
		rep(i,2)rep(j,2){
			string ta=a+(string)c[i],tb=b+(string)c[j];
			cout<<ta<<endl<<tb<<endl;
			string out;
			cin>>out;
			if(out=="T"){
				a=ta;b=tb;
				goto end;
			}
		}
		break;
		end:;
		if(a.size()==n)break;
	}
	if(a.size()!=n)while(1){
		bool h=false;
		rep(i,2)rep(j,2){
			string ta=(string)c[i]+a,tb=(string)c[j]+b;
			cout<<ta<<endl<<tb<<endl;
			string out;
			cin>>out;
			if(out=="T"){
				a=ta;b=tb;
				goto end1;
			}
		}
		break;
		end1:;
		if(a.size()==n)break;
	}
	cout<<a<<endl<<b<<endl;
}






